






def 						A_					(						lowercase_	,  lowercase_			)				->List[Any]:







 """simple docstring"""

 SCREAMING_SNAKE_CASE				    =		1
 while b > 0:
  if b & 1:
   res *= a

  a *= a
  b >>= 1

 return res





def 						A_					(						lowercase_	,  lowercase_	,  lowercase_			)				->Any:







 """simple docstring"""

 SCREAMING_SNAKE_CASE				    =		1
 while b > 0:
  if b & 1:
   SCREAMING_SNAKE_CASE				    =		((res % c) * (a % c)) % c

  a *= a
  b >>= 1

 return res









def 		__snake_case						(    _UpperCAmelCase       ,			_UpperCAmelCase				):
					"""simple docstring"""






					for index, item in enumerate(_UpperCAmelCase				):
										if item == target:
															return index
					return -1





def 		__snake_case						(    _UpperCAmelCase       ,			_UpperCAmelCase       ,			_UpperCAmelCase       ,			_UpperCAmelCase				):
					"""simple docstring"""






					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__":
		__magic_name__       =     input('''Enter numbers separated by comma:\n''').strip()
		__magic_name__       =     [int(item.strip()) for item in user_input.split(''',''')]

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






