



def  lowercase    (				SCREAMING_SNAKE_CASE__    :		list			,    SCREAMING_SNAKE_CASE__    :		int			)					->       int:







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



def  lowercase    (				SCREAMING_SNAKE_CASE__    :		list			,    SCREAMING_SNAKE_CASE__    :		int			,    SCREAMING_SNAKE_CASE__    :		int			,    SCREAMING_SNAKE_CASE__    :		int			)					->       int:







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

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





def  lowercase    (				SCREAMING_SNAKE_CASE__    :		float			,    SCREAMING_SNAKE_CASE__    :		float			)					->       float:
 _snake_case      :					str					=   float()
 try:
  _snake_case      :					str					=   mass * acceleration
 except Exception:
  return -0.0
 return force


if __name__ == "__main__":
  import doctest

  # run doctest
  doctest.testmod()

  # demo
  a__      =		12.5
  a__      =		10
  a__      =		newtons_second_law_of_motion(mass, acceleration)
  print("""The force is """, force, """N""")
