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

def     lowercase_       (    _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__":
      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 typing import Callable

def     lowercase_       (    _lowerCamelCase							: Callable):

    def wrapper(_lowerCamelCase							: str):
        lowercase__				:     Tuple					      =       function_with_docstring.__doc__
        return target_function

    return wrapper



