
'''simple docstring'''


def 				__magic_name__(					UpperCAmelCase__   :					int  ):
						UpperCamelCase_    :  Tuple				    =    9

						while num > 0:
												if num % 10 != digit:
																		return False
												num //= 100
												digit -= 1

						return True
def 				__magic_name__(					):
						UpperCamelCase_    :  Union[str, Any]				    =    138902663

						while not is_square_form(num * num  ):
												if num % 10 == 3:
																		num -= 6  # (3 - 6) % 10 = 7
												else:
																		num -= 4  # (7 - 4) % 10 = 3

						return num * 10


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






'''simple docstring'''


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




class 						__snake_case (						_a  ):




		def __init__(     self				:Optional[Any] ,						*_SCREAMING_SNAKE_CASE				:Union[str, Any] ,						**_SCREAMING_SNAKE_CASE				:List[Any])				-> List[str]:






								'''simple docstring'''






								super().__init__(*_SCREAMING_SNAKE_CASE ,						**_SCREAMING_SNAKE_CASE)




		def   _snake_case  (     self				:Union[str, Any] ,						_SCREAMING_SNAKE_CASE				:Union[str, Any] ,						_SCREAMING_SNAKE_CASE				:List[Any])				-> Optional[int]:






								'''simple docstring'''






								UpperCamelCase_    :  Optional[Any]				    =    (
								    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   _snake_case  (     self				:List[str] ,						_SCREAMING_SNAKE_CASE				:Optional[int] ,						_SCREAMING_SNAKE_CASE				:Any ,						_SCREAMING_SNAKE_CASE				:int)				-> Dict:






								'''simple docstring'''






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





		def   _snake_case  (     self				:Tuple ,						_SCREAMING_SNAKE_CASE				:Any ,						_SCREAMING_SNAKE_CASE				:int=None)				-> List[Any]:






								'''simple docstring'''






								UpperCamelCase_    :  Optional[Any]				    =    1
								UpperCamelCase_    :  str				    =    self.hash_function(_SCREAMING_SNAKE_CASE)

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

								return new_key




