


"""simple docstring"""


def   a__			(					__lowercase  ,      __lowercase )						->						Dict:
				sequence.append(__lowercase )

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

				sequence.pop()

				if index == len(__lowercase ):
								return None

				return index


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

		a_											=     input("Enter a single number to be found in the list:\n")
		a_											=     int(target_input)
		a_											=     sentinel_linear_search(sequence, target)
		if result is not None:
				print(f'''{target} found at positions: {result}''')
		else:
				print("Not found")



"""simple docstring"""


from .hash_table import HashTable
class snake_case   (	_UpperCamelCase):







		def __init__(       self   :							Any     , *a__   :							Any     , **a__   :							Tuple		)							->    Tuple:





						'''simple docstring'''







						super().__init__(*a__     , **a__		)







		def 			a_			(       self   :							Tuple     , a__   :							int     , a__   :							str=None		)							->    Optional[int]:





						'''simple docstring'''







						_A       	=      1
						_A       	=      self.hash_function(key + i * i		)

						while self.values[new_key] is not None and self.values[new_key] != key:
										i += 1
										_A       	=      (
										    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