
"""simple docstring"""






def     lowerCAmelCase__ (		__magic_name__			)	->Union[str, Any]:
			__lowercase						      =					[7_0_1, 3_0_1, 1_3_2, 5_7, 2_3, 1_0, 4, 1]
			for gap in gaps:
						for i in range(__magic_name__ ,      len(__magic_name__			)			):
									__lowercase						      =					collection[i]
									__lowercase						      =					i
									while j >= gap and collection[j - gap] > insert_value:
												__lowercase						      =					collection[j - gap]
												j -= gap
									if j != i:
												__lowercase						      =					insert_value
			return collection


if __name__ == "__main__":
					from doctest import testmod

					testmod()
					_lowercase							 =							input('''Enter numbers separated by a comma:\n''').strip()
					_lowercase							 =							[int(item) for item in user_input.split(''',''')]
					print(shell_sort(unsorted))







"""simple docstring"""






import os



def     lowerCAmelCase__ (		)	->Tuple:
			__lowercase						      =					0
			__lowercase						      =					0
			with open(os.path.dirname(__magic_name__			) + "/p022_names.txt"			) as file:
						__lowercase						      =					str(file.readlines()[0]			)
						__lowercase						      =					name.replace("\"" ,      ""			).split(","			)

			name.sort()
			for i in range(len(__magic_name__			)			):
						for j in name[i]:
									temp_sum += ord(__magic_name__			) - ord("A"			) + 1
						total_sum += (i + 1) * temp_sum
						__lowercase						      =					0
			return total_sum


if __name__ == "__main__":
					print(solution())





