






'''simple docstring'''




UpperCamelCase__	:     str    =			10**8


def     lowerCAmelCase_       (     _lowerCamelCase:       int ):
		if n % 10 == 0:
				return False
		__SCREAMING_SNAKE_CASE	:		int   	=		str(_lowerCamelCase )
		return s == s[::-1]


def     lowerCAmelCase_       (     ):
		__SCREAMING_SNAKE_CASE	:		List[Any]   	=		set()
		__SCREAMING_SNAKE_CASE	:		Union[str, Any]   	=		1
		__SCREAMING_SNAKE_CASE	:		Tuple   	=		5
		while sum_squares < LIMIT:
				__SCREAMING_SNAKE_CASE	:		List[Any]   	=		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
				__SCREAMING_SNAKE_CASE	:		List[str]   	=		first_square**2 + (first_square + 1) ** 2

		return sum(_lowerCamelCase )


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




'''simple docstring'''




from __future__ import annotations


def     lowerCAmelCase_       (     _lowerCamelCase:       list[int | float] ):
		if len(_lowerCamelCase ) == 0:
				raise ValueError("""find_min() arg is an empty sequence""" )
		__SCREAMING_SNAKE_CASE	:		List[str]   	=		nums[0]
		for num in nums:
				__SCREAMING_SNAKE_CASE	:		int   	=		min(_lowerCamelCase	,				_lowerCamelCase )
		return min_num


if __name__ == "__main__":
						import doctest

						doctest.testmod(verbose=True)