
"""simple docstring"""






class 				__a    :



							'''simple docstring'''







							def __init__(    self					) ->       None:




										'''simple docstring'''
										__lowercase						      =					[0, 1]





							def      SCREAMING_SNAKE_CASE	(    self     ,						_lowerCamelCase					) ->       list:




										'''simple docstring'''







										if (difference := index - (len(self.sequence					) - 2)) >= 1:
													for _ in range(__A					):
																self.sequence.append(self.sequence[-1] + self.sequence[-2]					)
										return self.sequence[:index]





def     lowerCAmelCase__ (		)	->None:
			print(
			    "Fibonacci Series Using Dynamic Programming\n" ,      "Enter the index of the Fibonacci number you want to calculate " ,      "in the prompt below. (To exit enter exit or Ctrl-C)\n" ,      sep="" ,      )
			__lowercase						      =					Fibonacci()

			while True:
						__lowercase						      =					input(">> "			)
						if prompt in {"exit", "quit"}:
									break

						try:
									__lowercase						      =					int(__magic_name__			)
						except ValueError:
									print("Enter a number or 'exit'"			)
									continue

						print(fibonacci.get(__magic_name__			)			)


if __name__ == "__main__":
					main()







"""simple docstring"""






import os



def     lowerCAmelCase__ (		)	->Tuple:
			__lowercase						      =					0
			__lowercase						      =					0
			with open(os.path.dirname(__magic_name__			) + "/p022_names.txt"			) as file:
						__lowercase						      =					str(file.readlines()[0]			)
						__lowercase						      =					name.replace("\"" ,      ""			).split(","			)

			name.sort()
			for i in range(len(__magic_name__			)			):
						for j in name[i]:
									temp_sum += ord(__magic_name__			) - ord("A"			) + 1
						total_sum += (i + 1) * temp_sum
						__lowercase						      =					0
			return total_sum


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





