




from .hash_table import HashTable





class 		A__				(   __SCREAMING_SNAKE_CASE ):






	def __init__(	self				,     *lowerCamelCase				,     **lowerCamelCase						)      ->   Tuple:




						"""simple docstring"""






						super().__init__(*lowerCamelCase				,     **lowerCamelCase						)






	def  lowercase      (	self				,     lowerCamelCase				,     lowerCamelCase=None						)      ->   Tuple:




						"""simple docstring"""






						__magic_name__					:							Tuple		   =							1
						__magic_name__					:							int		   =							self.hash_function(key + i * i						)

						while self.values[new_key] is not None and self.values[new_key] != key:
											i += 1
											__magic_name__					:							Optional[int]		   =							(
											    self.hash_function(key + i * i						)
											    if not self.balanced_factor() >= self.lim_charge
											    else None
											)

											if new_key is None:
																break

						return new_key









def  lowerCAmelCase  (	UpperCAmelCase       )  ->int:






					"""simple docstring"""






					return n * (2 * n - 1)







def  lowerCAmelCase  (	UpperCAmelCase       )  ->bool:






					"""simple docstring"""






					__magic_name__					:							Any		   =							(1 + 24 * n) ** 0.5
					return ((1 + root) / 6) % 1 == 0







def  lowerCAmelCase  (	UpperCAmelCase = 144       )  ->int:






					"""simple docstring"""






					__magic_name__					:							Optional[int]		   =							start
					__magic_name__					:							int		   =							hexagonal_num(UpperCAmelCase       )
					while not is_pentagonal(UpperCAmelCase       ):
										n += 1
										__magic_name__					:							Optional[int]		   =							hexagonal_num(UpperCAmelCase       )
					return num


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



