


def 		lowercase_(  SCREAMING_SNAKE_CASE_     ):


  '''simple docstring'''

  if len(SCREAMING_SNAKE_CASE_     ) > 1:
    lowerCamelCase			: Optional[int]   =    len(SCREAMING_SNAKE_CASE_     ) // 2  # Finds the middle of the array
    lowerCamelCase			: Any   =    arr[
        :middle_length
    ]  # Creates an array of the elements in the first half.
    lowerCamelCase			: List[Any]   =    arr[
        middle_length:
    ]  # Creates an array of the elements in the second half.
    lowerCamelCase			: int   =    len(SCREAMING_SNAKE_CASE_     )
    lowerCamelCase			: Tuple   =    len(SCREAMING_SNAKE_CASE_     )
    merge(SCREAMING_SNAKE_CASE_     )  # Starts sorting the left.
    merge(SCREAMING_SNAKE_CASE_     )  # Starts sorting the right
    lowerCamelCase			: Tuple   =    0  # Left Counter
    lowerCamelCase			: Optional[int]   =    0  # Right Counter
    lowerCamelCase			: Dict   =    0  # Position Counter
    while (
        left_index < left_size and right_index < right_size
    ):  # Runs until the lowers size of the left and right are sorted.
      if left_array[left_index] < right_array[right_index]:
        lowerCamelCase			: Union[str, Any]   =    left_array[left_index]
        left_index += 1
      else:
        lowerCamelCase			: List[str]   =    right_array[right_index]
        right_index += 1
      index += 1
    while (
        left_index < left_size
    ):  # Adds the left over elements in the left half of the array
      lowerCamelCase			: Union[str, Any]   =    left_array[left_index]
      left_index += 1
      index += 1
    while (
        right_index < right_size
    ):  # Adds the left over elements in the right half of the array
      lowerCamelCase			: int   =    right_array[right_index]
      right_index += 1
      index += 1
  return arr


if __name__ == "__main__":
   import doctest

   doctest.testmod()







def 		lowercase_(  SCREAMING_SNAKE_CASE_				,						SCREAMING_SNAKE_CASE_     ):


  '''simple docstring'''

  sequence.append(SCREAMING_SNAKE_CASE_     )

  lowerCamelCase			: str   =    0
  while sequence[index] != target:
    index += 1

  sequence.pop()

  if index == len(SCREAMING_SNAKE_CASE_     ):
    return None

  return index


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

   _snake_case					=					input('''Enter a single number to be found in the list:\n''')
   _snake_case					=					int(target_input)
   _snake_case					=					sentinel_linear_search(sequence, target)
   if result is not None:
      print(f'''{target} found at positions: {result}''')
   else:
      print('''Not found''')



