





'''simple docstring'''







def 							lowerCamelCase_   (	SCREAMING_SNAKE_CASE__   :      list,      SCREAMING_SNAKE_CASE__   :      int )			->						int:
						for index, item in enumerate(SCREAMING_SNAKE_CASE__ ):
												if item == target:
																		return index
						return -1





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


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

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










'''simple docstring'''






def        snake_case_   (	lowerCAmelCase_			,  lowerCAmelCase_						)->						float:





       '''simple docstring'''


       return a + b


if __name__ == "__main__":
   A_				:					Tuple							=      5
   A_				:					Tuple							=      6
   print(f"""The sum of {a} + {b} is {add(a, b)}""")



