


'''simple docstring'''





import os
def        UpperCamelCase_(				)->		List[Any]:
			with open(os.path.dirname(_A  ) + "/p022_names.txt"  ) as file:
						UpperCamelCase__					=       str(file.readlines()[0]  )
						UpperCamelCase__					=       names.replace("\""				,     ""  ).split(","  )

			names.sort()

			UpperCamelCase__					=       0
			UpperCamelCase__					=       0

			for i, name in enumerate(_A  ):
						for letter in name:
									name_score += ord(_A  ) - 64

						total_score += (i + 1) * name_score
						UpperCamelCase__					=       0
			return total_score


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






def        UpperCamelCase_(				_A   :int				,     _A   :int  )->		str:
			if number < 0 or shift_amount < 0:
						raise ValueError("both inputs must be positive integers"  )

			UpperCamelCase__					=       str(bin(_A  )  )
			binary_number += "0" * shift_amount
			return binary_number
def        UpperCamelCase_(				_A   :int				,     _A   :int  )->		str:
			if number < 0 or shift_amount < 0:
						raise ValueError("both inputs must be positive integers"  )

			UpperCamelCase__					=       str(bin(_A  )  )[2:]
			if shift_amount >= len(_A  ):
						return "0b0"
			UpperCamelCase__					=       binary_number[: len(_A  ) - shift_amount]
			return "0b" + shifted_binary_number
def        UpperCamelCase_(				_A   :int				,     _A   :int  )->		str:
			if number >= 0:  # Get binary representation of positive number
						UpperCamelCase__					=       "0" + str(bin(_A  )  ).strip("-"  )[2:]
			else:  # Get binary (2's complement) representation of negative number
						UpperCamelCase__					=       len(bin(_A  )[3:]  )  # Find 2's complement of number
						UpperCamelCase__					=       bin(abs(_A  ) - (1 << binary_number_length)  )[3:]
						UpperCamelCase__					=       (
						    "1" + "0" * (binary_number_length - len(_A  )) + binary_number
						)

			if shift_amount >= len(_A  ):
						return "0b" + binary_number[0] * len(_A  )
			return (
			    "0b"
			    + binary_number[0] * shift_amount
			    + binary_number[: len(_A  ) - shift_amount]
			)


if __name__ == "__main__":
						import doctest

						doctest.testmod()


