





import os







def 			_SCREAMING_SNAKE_CASE    (       )				->				List[Any]:
					__A     :						Tuple          =    0
					__A     :						Any          =    0
					with open(os.path.dirname(a  ) + '/p022_names.txt'  ) as file:
										__A     :						Any          =    str(file.readlines()[0]  )
										__A     :						Optional[Any]          =    name.replace('"' ,						''  ).split(','  )

					name.sort()
					for i in range(len(a  )  ):
										for j in name[i]:
															temp_sum += ord(a  ) - ord('A'  ) + 1
										total_sum += (i + 1) * temp_sum
										__A     :						List[str]          =    0
					return total_sum


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











from .hash_table import HashTable





class 						_A( snake_case__       ):


				"""simple docstring"""


				def __init__(      self					, *_A					, **_A					):
									super().__init__(*_A					, **_A					)





				def  UpperCAmelCase_		(      self					, _A					, _A=None					):
									__A     :						Optional[int]          =    1
									__A     :						Union[str, Any]          =    self.hash_function(key + i * i					)

									while self.values[new_key] is not None and self.values[new_key] != key:
														i += 1
														__A     :						Tuple          =    (
														    self.hash_function(key + i * i					)
														    if not self.balanced_factor() >= self.lim_charge
														    else None
														)

														if new_key is None:
																			break

									return new_key




