






from __future__ import annotations





def   SCREAMING_SNAKE_CASE__						(   snake_case_,  snake_case_,  snake_case_  )   ->  tuple[float, float]:


	"""simple docstring"""



	assert (
	    c % greatest_common_divisor(SCREAMING_SNAKE_CASE__,  SCREAMING_SNAKE_CASE__  ) == 0
	)  # greatest_common_divisor(a,b) function implemented below
	(a)		=			extended_gcd(SCREAMING_SNAKE_CASE__,  SCREAMING_SNAKE_CASE__  )  # extended_gcd(a,b) function implemented below
	a		=			c / d
	return (r * x, r * y)





def   SCREAMING_SNAKE_CASE__						(   snake_case_,  snake_case_,  snake_case_,  snake_case_ = 2  )   ->  None:


	"""simple docstring"""



	(a)		=			diophantine(SCREAMING_SNAKE_CASE__,  SCREAMING_SNAKE_CASE__,  SCREAMING_SNAKE_CASE__  )  # Initial value
	a		=			greatest_common_divisor(SCREAMING_SNAKE_CASE__,  SCREAMING_SNAKE_CASE__  )
	a		=			a // d
	a		=			b // d

	for i in range(SCREAMING_SNAKE_CASE__  ):
		a		=			xa + i * q
		a		=			ya - i * p
		print(SCREAMING_SNAKE_CASE__,  SCREAMING_SNAKE_CASE__  )





def   SCREAMING_SNAKE_CASE__						(   snake_case_,  snake_case_  )   ->  int:


	"""simple docstring"""



	if a < b:
		a		=			b, a

	while a % b != 0:
		a		=			b, a % b

	return b





def   SCREAMING_SNAKE_CASE__						(   snake_case_,  snake_case_  )   ->  tuple[int, int, int]:


	"""simple docstring"""



	assert a >= 0 and b >= 0

	if b == 0:
		a		=			a, 1, 0
	else:
		(a)		=			extended_gcd(SCREAMING_SNAKE_CASE__,  a % b  )
		a		=			q
		a		=			p - q * (a // b)

	assert a % d == 0 and b % d == 0
	assert d == a * x + b * y

	return (d, x, y)


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

				testmod(name="""diophantine""", verbose=True)
				testmod(name="""diophantine_all_soln""", verbose=True)
				testmod(name="""extended_gcd""", verbose=True)
				testmod(name="""greatest_common_divisor""", verbose=True)













UpperCamelCase__						:      Dict								=					10**8





def   SCREAMING_SNAKE_CASE__						(   snake_case_  )   ->  bool:


	"""simple docstring"""



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





def   SCREAMING_SNAKE_CASE__						(   )   ->  int:


	"""simple docstring"""



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

	return sum(snake_case_  )


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





