


'''simple docstring'''



from graphs.minimum_spanning_tree_kruskal import kruskal






def   lowerCamelCase							():
					__a      :	str    =  9
					__a      :	List[str]    =  [
					    [0, 1, 4],
					    [0, 7, 8],
					    [1, 2, 8],
					    [7, 8, 7],
					    [7, 6, 1],
					    [2, 8, 2],
					    [8, 6, 6],
					    [2, 3, 7],
					    [2, 5, 4],
					    [6, 5, 2],
					    [3, 5, 14],
					    [3, 4, 9],
					    [5, 4, 10],
					    [1, 7, 11],
					]

					__a      :	Tuple    =  kruskal(_SCREAMING_SNAKE_CASE						,				_SCREAMING_SNAKE_CASE       )

					__a      :	Tuple    =  [
					    [7, 6, 1],
					    [2, 8, 2],
					    [6, 5, 2],
					    [0, 1, 4],
					    [2, 5, 4],
					    [2, 3, 7],
					    [0, 7, 8],
					    [3, 4, 9],
					]

					assert sorted(_SCREAMING_SNAKE_CASE       ) == sorted(_SCREAMING_SNAKE_CASE       )







'''simple docstring'''



import os






def   lowerCamelCase							():
					with open(os.path.dirname(_SCREAMING_SNAKE_CASE       ) + '/p022_names.txt'       ) as file:
										__a      :	List[Any]    =  str(file.readlines()[0]       )
										__a      :	str    =  names.replace('"'						,				''       ).split(','       )

					names.sort()

					__a      :	Union[str, Any]    =  0
					__a      :	Tuple    =  0

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

										total_score += (i + 1) * name_score
										__a      :	Any    =  0
					return total_score


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



