


'''simple docstring'''



from __future__ import annotations






def   lowerCamelCase							(_SCREAMING_SNAKE_CASE				:       list[int]       ):
					__a      :	List[str]    =  len(lowerCamelCase_       ) // 2

					# choose the middle 3 elements
					__a      :	Dict    =  lst[m - 1 : m + 2]

					# if middle element is peak
					if three[1] > three[0] and three[1] > three[2]:
										return three[1]

					# if increasing, recurse on right
					elif three[0] < three[2]:
										if len(lst[:m]       ) == 2:
															m -= 1
										return peak(lst[m:]       )

					# decreasing
					else:
										if len(lst[:m]       ) == 2:
															m += 1
										return peak(lst[:m]       )


if __name__ == "__main__":
						import doctest

						doctest.testmod()







'''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())



