






from typing import Callable






def     lowerCamelCase__				(   __lowerCamelCase      :					Callable		):

  def wrapper(__lowerCamelCase      :					Any		):
    __UpperCAmelCase							:     Optional[Any]									=  function_with_docstring.__doc__
    return target_function

  return wrapper










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






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


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

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


