


a__  : int				=	1_0**8







def _UpperCamelCase	(					__A   )							->		bool:


      '''simple docstring'''



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







def _UpperCamelCase	(					)							->		int:


      '''simple docstring'''



      UpperCamelCase__  =    set()
      UpperCamelCase__  =    1
      UpperCamelCase__  =    5
      while sum_squares < LIMIT:
            UpperCamelCase__  =    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
            UpperCamelCase__  =    first_square**2 + (first_square + 1) ** 2

      return sum(__A   )


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









'''simple docstring'''







from itertools import permutations







def _UpperCamelCase	(					)							->		Optional[int]:


      '''simple docstring'''



      UpperCamelCase__  =    list(map("".join				,      permutations("0123456789"   )   )   )
      return result[999999]


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





