code: 
  '''simple docstring'''
  
  
  
  
  
  A           =   1_0**8
  def   snake_case_       (							_a     :							int			):
        if n % 10 == 0:
              return False
        snake_case_						       =							str(_a			)
        return s == s[::-1]
  def   snake_case_       (							):
        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(_a			):
                          answer.add(_a			)
                    last_square += 1
                    sum_squares += last_square**2
              first_square += 1
              snake_case_						       =							first_square**2 + (first_square + 1) ** 2
  
        return sum(_a			)
  
  
  if __name__ == "__main__":
       print(solution())
  
  
style_context: 
  '''simple docstring'''
  
  
  
  
  
  def   snake_case_       (							_a     :							List[str] ,					_a     :							List[str]			):
        snake_case_						       =							1
        while b > 0:
              if b & 1:
                    res *= a
  
              a *= a
              b >>= 1
  
        return res
  def   snake_case_       (							_a     :							Union[str, Any] ,					_a     :							Tuple ,					_a     :							Optional[Any]			):
        snake_case_						       =							1
        while b > 0:
              if b & 1:
                    snake_case_						       =							((res % c) * (a % c)) % c
  
              a *= a
              b >>= 1
  
        return res
  
  