


SCREAMING_SNAKE_CASE		:List[str]											=       10**8



def 	_lowerCAmelCase  (							lowerCAmelCase_							:Optional[int]							)->List[Any]:
   '''simple docstring'''






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



def 	_lowerCAmelCase  (							)->Tuple:
   '''simple docstring'''






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

   return sum(lowerCAmelCase_							)


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








from __future__ import annotations



def      _lowerCAmelCase  (							lowerCAmelCase_							:int							)->list[int]:
   '''simple docstring'''






   assert (
       isinstance(lowerCAmelCase_						,  lowerCAmelCase_							) and mask > 0
   ), F'''mask needs to be positive integer, your input {mask}'''
   snake_case_         =   []
   snake_case_         =   mask

   while submask:
      all_submasks.append(lowerCAmelCase_							)
      snake_case_         =   (submask - 1) & mask

   return all_submasks


if __name__ == "__main__":
   import doctest

   doctest.testmod()




