


def      __lowerCAmelCase    (				snake_case						:     str    ,   snake_case						:     List[str]			)							->				Optional[Any]:
   sequence.append(a_			)

   __lowerCamelCase:					Union[str, Any]	 =						0
   while sequence[index] != target:
      index += 1

   sequence.pop()

   if index == len(a_			):
      return None

   return index


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

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





def        _lowercase  (					a_					:       str       ,a_					:       List[str]					)					->						Optional[Any]:




					'''simple docstring'''







					sequence.append(a_					)

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

					sequence.pop()

					if index == len(a_					):
										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")




