




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

def      lowerCAmelCase_     (					lowerCamelCase:    int  )   ->     bool:


      '''simple docstring'''




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

def      lowerCAmelCase_     (					)   ->     int:


      '''simple docstring'''




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

      return sum(lowerCamelCase  )


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





from __future__ import annotations

def      lowerCAmelCase_     (					lowerCamelCase:    list[int | float]  )   ->     int | float:


      '''simple docstring'''




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


if __name__ == "__main__":
      import doctest

      doctest.testmod(verbose=True)