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


def 		_UpperCAmelCase			(					_lowerCamelCase  :    list					, _lowerCamelCase  :    int					, _lowerCamelCase  :    int					, _lowerCamelCase  :    int						)      ->  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}')




'''simple docstring'''

def 		_UpperCAmelCase			(					_lowerCamelCase  :    int = 1_00						)      ->  int:
  _lowerCAmelCase    :					Dict							=   [[0 for _ in range(_lowerCamelCase						)] for _ in range(m + 1						)]
  for i in range(m + 1						):
    _lowerCAmelCase    :					List[str]							=   1

  for n in range(m + 1						):
    for k in range(1					, _lowerCamelCase						):
      memo[n][k] += memo[n][k - 1]
      if n > k:
        memo[n][k] += memo[n - k - 1][k]

  return memo[m][m - 1] - 1


if __name__ == "__main__":
     print(solution(int(input("""Enter a number: """).strip())))


