

def    snake_case_(_UpperCamelCase = 100  )							->			int:



  """simple docstring"""






  _snake_case		=							[[0 for _ in range(_UpperCamelCase  )] for _ in range(m + 1  )]
  for i in range(m + 1  ):
    _snake_case		=							1

  for n in range(m + 1  ):
    for k in range(1				, _UpperCamelCase  ):
      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())))




from __future__ import annotations



def    snake_case_(_UpperCamelCase  )							->			int | float:



  """simple docstring"""






  if len(_UpperCamelCase  ) == 0:
    raise ValueError('''find_max() arg is an empty sequence'''  )
  _snake_case		=							nums[0]
  for x in nums:
    if x > max_num:
      _snake_case		=							x
  return max_num


if __name__ == "__main__":
 import doctest

 doctest.testmod(verbose=True)

