






from .hash_table import HashTable
from .number_theory.prime_numbers import is_prime, next_prime







class 				lowerCamelCase_     (	a_     ):
							def __init__(						self		:					Union[str, Any]							,*__lowerCamelCase		:					List[Any]							,**__lowerCamelCase		:					Any					):





								'''simple docstring'''



								super().__init__(*__lowerCamelCase							,**__lowerCamelCase					)
							def  SCREAMING_SNAKE_CASE_ (						self		:					Any							,__lowerCamelCase		:					str							,__lowerCamelCase		:					str					):





								'''simple docstring'''



								a		=			(
								    next_prime(value % self.size_table					)
								    if not is_prime(value % self.size_table					)
								    else value % self.size_table
								)  # gt = bigger than
								return next_prime_gt - (data % next_prime_gt)
							def  SCREAMING_SNAKE_CASE_ (						self		:					List[str]							,__lowerCamelCase		:					Union[str, Any]							,__lowerCamelCase		:					List[str]							,__lowerCamelCase		:					int					):





								'''simple docstring'''



								return (increment * self.__hash_function_a(__lowerCamelCase							,__lowerCamelCase					)) % self.size_table




							def  SCREAMING_SNAKE_CASE_ (						self		:					List[Any]							,__lowerCamelCase		:					Optional[int]							,__lowerCamelCase		:					Optional[int]=None					):





								'''simple docstring'''



								a		=			1
								a		=			self.hash_function(__lowerCamelCase					)

								while self.values[new_key] is not None and self.values[new_key] != key:
									a		=			(
									    self.__hash_double_function(__lowerCamelCase							,__lowerCamelCase							,__lowerCamelCase					)
									    if self.balanced_factor() >= self.lim_charge
									    else None
									)
									if new_key is None:
										break
									else:
										i += 1

								return new_key













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





