



from __future__ import annotations

import sys





def 						__lowerCamelCase       (      __magic_name__	:  int     , __magic_name__	:  int						):
							# base cases
							if abs(__magic_name__						) == 1:
														return a, 0
							elif abs(__magic_name__						) == 1:
														return 0, b

							a__							,			a__:       int											=a, b
							a__							,			a__:       int											=1, 0
							a__							,			a__:       Any											=0, 1

							while remainder != 0:
														a__:       str											=old_remainder // remainder
														a__							,			a__:       str											=remainder, old_remainder - quotient * remainder
														a__							,			a__:       Dict											=coeff_a, old_coeff_a - quotient * coeff_a
														a__							,			a__:       List[str]											=coeff_b, old_coeff_b - quotient * coeff_b

							# sign correction for negative numbers
							if a < 0:
														a__:       str											=-old_coeff_a
							if b < 0:
														a__:       Optional[int]											=-old_coeff_b

							return old_coeff_a, old_coeff_b





def 						__lowerCamelCase       (      ):
							if len(sys.argv						) < 3:
														print("2 integer arguments required"						)
														return 1
							a__:       Optional[Any]											=int(sys.argv[1]						)
							a__:       str											=int(sys.argv[2]						)
							print(extended_euclidean_algorithm(__magic_name__     , __magic_name__						)						)
							return 0


if __name__ == "__main__":
		raise SystemExit(main())










def 						__lowerCamelCase       (      __magic_name__	:  list     , __magic_name__	:  int						):
							for index, item in enumerate(__magic_name__						):
														if item == target:
																					return index
							return -1





def 						__lowerCamelCase       (      __magic_name__	:  list     , __magic_name__	:  int     , __magic_name__	:  int     , __magic_name__	:  int						):
							if not (0 <= high < len(__magic_name__						) and 0 <= low < len(__magic_name__						)):
														raise Exception("Invalid upper or lower bound!"						)
							if high < low:
														return -1
							if sequence[low] == target:
														return low
							if sequence[high] == target:
														return high
							return rec_linear_search(__magic_name__     , low + 1     , high - 1     , __magic_name__						)


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

		__UpperCAmelCase						  =     int(input('''Enter a single number to be found in the list:\n''').strip())
		__UpperCAmelCase						  =     linear_search(sequence, target)
		if result != -1:
				print(f"""linear_search({sequence}, {target}) = {result}""")
		else:
				print(f"""{target} was not found in {sequence}""")





