






from itertools import compress, repeat
from math import ceil, sqrt





def   SCREAMING_SNAKE_CASE__						(   snake_case_  )   ->  list[int]:


	"""simple docstring"""



	if num <= 2:
		return []
	if num == 3:
		return [2]

	# Odd sieve for numbers in range [3, num - 1]
	a		=			bytearray(b'''\x01'''  ) * ((num >> 1) - 1)

	for i in range(3,  int(sqrt(snake_case_  )  ) + 1,  2  ):
		if sieve[(i >> 1) - 1]:
			a		=			i**2
			a		=			repeat(
			    0,  ceil((num - i_squared) / (i << 1)  )  )

	return [2] + list(compress(range(3,  snake_case_,  2  ),  snake_case_  )  )


if __name__ == "__main__":
				import doctest

				doctest.testmod()













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())





