
UpperCamelCase_	:    Union[str, Any]  					=       10**8



def 		UpperCamelCase    (					_UpperCAmelCase     :      int     )      -> str:






						'''simple docstring'''

						if n % 10 == 0:
												return False
						_lowercase					:  Optional[int]    			=      str(lowercase_     )
						return s == s[::-1]



def 		UpperCamelCase    (					)      -> Dict:






						'''simple docstring'''

						_lowercase					:  Union[str, Any]    			=      set()
						_lowercase					:  Tuple    			=      1
						_lowercase					:  int    			=      5
						while sum_squares < LIMIT:
												_lowercase					:  int    			=      first_square + 1
												while sum_squares < LIMIT:
																		if is_palindrome(lowercase_     ):
																								answer.add(lowercase_     )
																		last_square += 1
																		sum_squares += last_square**2
												first_square += 1
												_lowercase					:  List[Any]    			=      first_square**2 + (first_square + 1) ** 2

						return sum(lowercase_     )


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








import os



def 		UpperCamelCase    (					)      -> Optional[int]:






						'''simple docstring'''

						_lowercase					:  Tuple    			=      0
						_lowercase					:  List[Any]    			=      0
						with open(os.path.dirname(_UpperCAmelCase     ) + "/p022_names.txt"     ) as file:
												_lowercase					:  Any    			=      str(file.readlines()[0]     )
												_lowercase					:  int    			=      name.replace("\""   , ""     ).split(","     )

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


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




