





import os





def    __UpperCamelCase      (    ) ->str:
					with open(os.path.dirname(lowercase__) + "/p022_names.txt") as file:
										lowerCamelCase__       =       str(file.readlines()[0])
										lowerCamelCase__       =       names.replace("\"",     "").split(",")

					names.sort()

					lowerCamelCase__       =       0
					lowerCamelCase__       =       0

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

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


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








def    __UpperCamelCase      (    a,     a) ->Optional[int]:
					lowerCamelCase__       =       [1]
					for i in range(2,     a):
										factorials.append(factorials[-1] * i)
					assert 0 <= k < factorials[-1] * n, "k out of bounds"

					lowerCamelCase__       =       []
					lowerCamelCase__       =       list(range(a))

					# Find permutation
					while factorials:
										lowerCamelCase__       =       factorials.pop()
										lowerCamelCase__    ,		lowerCamelCase__       =       divmod(a,     a)
										permutation.append(elements[number])
										elements.remove(elements[number])
					permutation.append(elements[0])

					return permutation


if __name__ == "__main__":
						import doctest

						doctest.testmod()

