





__UpperCAmelCase						=      10**8


def 			__UpperCamelCase				(			lowercase__	:       int		)	->      bool:
    '''simple docstring'''





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


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





    lowerCAmelCase_					:	Union[str, Any]						=   set()
    lowerCAmelCase_					:	Optional[int]						=   1
    lowerCAmelCase_					:	Dict						=   5
    while sum_squares < LIMIT:
        lowerCAmelCase_					:	Optional[Any]						=   first_square + 1
        while sum_squares < LIMIT:
            if is_palindrome(lowercase__		):
                answer.add(lowercase__		)
            last_square += 1
            sum_squares += last_square**2
        first_square += 1
        lowerCAmelCase_					:	Optional[Any]						=   first_square**2 + (first_square + 1) ** 2

    return sum(lowercase__		)


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









def 			__UpperCamelCase				(			lowercase__	:       set		,    lowercase__	:       set		)	->      set:
    '''simple docstring'''





    assert isinstance(lowercase__		,    lowercase__		), f'The input value of [set_a={set_a}] is not a set'
    assert isinstance(lowercase__		,    lowercase__		), f'The input value of [set_b={set_b}] is not a set'

    return {a + b for a in set_a for b in set_b}


if __name__ == "__main__":
  from doctest import testmod

  testmod()


