




lowercase_      :							Any    							=					10**8


def 				__SCREAMING_SNAKE_CASE    (     snake_case_		):

						'''simple docstring'''


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


def 				__SCREAMING_SNAKE_CASE    (     ):

						'''simple docstring'''


						_UpperCAmelCase						=	set()
						_UpperCAmelCase						=	1
						_UpperCAmelCase						=	5
						while sum_squares < LIMIT:
												_UpperCAmelCase						=	first_square + 1
												while sum_squares < LIMIT:
																		if is_palindrome(snake_case_		):
																								answer.add(snake_case_		)
																		last_square += 1
																		sum_squares += last_square**2
												first_square += 1
												_UpperCAmelCase						=	first_square**2 + (first_square + 1) ** 2

						return sum(snake_case_		)


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







'''simple docstring'''


from itertools import combinations, product







def     SCREAMING_SNAKE_CASE(	UpperCamelCase ,UpperCamelCase ,UpperCamelCase ,UpperCamelCase	)     ->     bool:
	if xa == ya == 0 or xa == ya == 0:
		return False
	UpperCAmelCase_		:   int													=       xa * xa + ya * ya
	UpperCAmelCase_		:   List[str]													=       xa * xa + ya * ya
	UpperCAmelCase_		:   Optional[Any]													=       (xa - xa) * (xa - xa) + (ya - ya) * (ya - ya)
	return (
	    a_square + b_square == c_square
	    or a_square + c_square == b_square
	    or b_square + c_square == a_square
	)







def     SCREAMING_SNAKE_CASE(	UpperCamelCase = 5_0	)     ->     int:
	return sum(
	    1
	    for pta, pta in combinations(product(range(limit + 1	) ,repeat=2	) ,2	)
	    if is_right(*UpperCamelCase ,*UpperCamelCase	)	)


if __name__ == "__main__":
						print(F'{solution() = }')






