





def 			lowerCAmelCase_			(				UpperCamelCase_       ,		UpperCamelCase_	)  ->		int:
       for index, item in enumerate(UpperCamelCase_	):
              if item == target:
                     return index
       return -1




def 			lowerCAmelCase_			(				UpperCamelCase_       ,		UpperCamelCase_       ,		UpperCamelCase_       ,		UpperCamelCase_	)  ->		int:
       if not (0 <= high < len(UpperCamelCase_	) and 0 <= low < len(UpperCamelCase_	)):
              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(UpperCamelCase_       ,		low + 1       ,		high - 1       ,		UpperCamelCase_	)


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}''')





from __future__ import annotations

import sys







def 	A (		A__		,		A__			):
     # base cases
     if abs(A__			) == 1:
          return a, 0
     elif abs(A__			) == 1:
          return 0, b

     UpperCAmelCase	,			UpperCAmelCase    :					Any			=      a, b
     UpperCAmelCase	,			UpperCAmelCase    :					List[Any]			=      1, 0
     UpperCAmelCase	,			UpperCAmelCase    :					Union[str, Any]			=      0, 1

     while remainder != 0:
          UpperCAmelCase    :					Union[str, Any]			=      old_remainder // remainder
          UpperCAmelCase	,			UpperCAmelCase    :					Dict			=      remainder, old_remainder - quotient * remainder
          UpperCAmelCase	,			UpperCAmelCase    :					int			=      coeff_a, old_coeff_a - quotient * coeff_a
          UpperCAmelCase	,			UpperCAmelCase    :					Optional[Any]			=      coeff_b, old_coeff_b - quotient * coeff_b

     # sign correction for negative numbers
     if a < 0:
          UpperCAmelCase    :					Union[str, Any]			=      -old_coeff_a
     if b < 0:
          UpperCAmelCase    :					int			=      -old_coeff_b

     return old_coeff_a, old_coeff_b







def 	A (		):
     if len(sys.argv			) < 3:
          print("2 integer arguments required"			)
          return 1
     UpperCAmelCase    :					Union[str, Any]			=      int(sys.argv[1]			)
     UpperCAmelCase    :					Any			=      int(sys.argv[2]			)
     print(extended_euclidean_algorithm(A__		,		A__			)			)
     return 0


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



