





a__			:    Tuple			      =		10**8

def     UpperCAmelCase_						(						_UpperCAmelCase       :List[str]							)  ->							Optional[Any]:
     '''simple docstring'''


     if n % 10 == 0:
          return False
     A_					      =					str(__A							)
     return s == s[::-1]

def     UpperCAmelCase_						(						)  ->							int:
     '''simple docstring'''


     A_					      =					set()
     A_					      =					1
     A_					      =					5
     while sum_squares < LIMIT:
          A_					      =					first_square + 1
          while sum_squares < LIMIT:
               if is_palindrome(__A							):
                    answer.add(__A							)
               last_square += 1
               sum_squares += last_square**2
          first_square += 1
          A_					      =					first_square**2 + (first_square + 1) ** 2

     return sum(__A							)


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






from __future__ import annotations

def     UpperCAmelCase_						(						_UpperCAmelCase       :list[int | float]							)  ->							int | float:
     '''simple docstring'''


     if len(_UpperCAmelCase							) == 0:
          raise ValueError('''find_max() arg is an empty sequence'''							)
     A_					      =					nums[0]
     for x in nums:
          if x > max_num:
               A_					      =					x
     return max_num


if __name__ == "__main__":
      import doctest

      doctest.testmod(verbose=True)



