





from .hash_table import HashTable

class 					__A   (  a			):


				def __init__(						self      ,       *UpperCAmelCase_      ,       **UpperCAmelCase_							):
								super().__init__(*UpperCAmelCase_      ,       **UpperCAmelCase_							)


				def _snake_case				(						self      ,       UpperCAmelCase_      ,       UpperCAmelCase_=None							):
								lowerCamelCase		       =1
								lowerCamelCase		       =self.hash_function(key + i * i							)

								while self.values[new_key] is not None and self.values[new_key] != key:
												i += 1
												lowerCamelCase		       =(
												    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(	__lowerCamelCase      ,				__lowerCamelCase						):
					sequence.append(__lowerCamelCase						)

					__a							=   0
					while sequence[index] != target:
										index += 1

					sequence.pop()

					if index == len(__lowerCamelCase						):
										return None

					return index


if __name__ == "__main__":
	lowerCamelCase_				:		List[str]       						=       input("""Enter numbers separated by comma:\n""").strip()
	lowerCamelCase_				:		str       						=       [int(item) for item in user_input.split(""",""")]

	lowerCamelCase_				:		Tuple       						=       input("""Enter a single number to be found in the list:\n""")
	lowerCamelCase_				:		Optional[int]       						=       int(target_input)
	lowerCamelCase_				:		List[Any]       						=       sentinel_linear_search(sequence, target)
	if result is not None:
		print(F'''{target} found at positions: {result}''')
	else:
		print("""Not found""")




