






'''simple docstring'''

def 				__UpperCamelCase							(	lowercase__						:  int = 1_00 ):






     '''simple docstring'''





     __lowercase					=[[0 for _ in range(_UpperCamelCase )] for _ in range(m + 1 )]
     for i in range(m + 1 ):
          __lowercase					=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())))





'''simple docstring'''

from __future__ import annotations

def 				__UpperCamelCase							(	lowercase__						:  list[int | float],					lowercase__						:  int,					lowercase__						:  int ):






     '''simple docstring'''





     if len(lowercase__ ) == 0:
          raise ValueError('find_min() arg is an empty sequence' )
     if (
         left >= len(lowercase__ )
         or left < -len(lowercase__ )
         or right >= len(lowercase__ )
         or right < -len(lowercase__ )
     ):
          raise IndexError('list index out of range' )
     if left == right:
          return nums[left]
     __lowercase					=(left + right) >> 1  # the middle
     __lowercase					=find_min(lowercase__,					lowercase__,					lowercase__ )  # find min in range[left, mid]
     __lowercase					=find_min(lowercase__,					mid + 1,					lowercase__ )  # find min in range[mid + 1, right]

     return left_min if left_min <= right_min else right_min


if __name__ == "__main__":
       import doctest

       doctest.testmod(verbose=True)


