





from __future__ import annotations
def 				__UpperCamelCase  (		snake_case    ,	snake_case    ,	snake_case     )  ->						List[str]:


   '''simple docstring'''







   assert n > 1 and a > 0 and greatest_common_divisor(snake_case    ,	snake_case     ) == 1
   (__A)				 =       extended_gcd(snake_case    ,	snake_case     )  # Implemented below
   __A				 =       (b * s) % n
   return x
def 				__UpperCamelCase  (		snake_case    ,	snake_case     )  ->						int:


   '''simple docstring'''







   (__A)				 =       extended_euclid(snake_case    ,	snake_case     )  # Implemented below
   if b < 0:
      __A				 =       (b % n + n) % n
   return b
def 				__UpperCamelCase  (		snake_case    ,	snake_case    ,	snake_case     )  ->						int:


   '''simple docstring'''







   __A				 =       invert_modulo(snake_case    ,	snake_case     )
   __A				 =       (b * s) % n
   return x
def 				__UpperCamelCase  (		snake_case    ,	snake_case     )  ->						int:


   '''simple docstring'''







   assert a >= 0 and b >= 0

   if b == 0:
      __A				 =       a, 1, 0
   else:
      (__A)				 =       extended_gcd(snake_case    ,	a % b     )
      __A				 =       q
      __A				 =       p - q * (a // b)

   assert a % d == 0 and b % d == 0
   assert d == a * x + b * y

   return (d, x, y)
def 				__UpperCamelCase  (		snake_case    ,	snake_case     )  ->						List[Any]:


   '''simple docstring'''







   if b == 0:
      return (1, 0)
   (__A)				 =       extended_euclid(snake_case    ,	a % b     )
   __A				 =       a // b
   return (y, x - k * y)
def 				__UpperCamelCase  (		snake_case    ,	snake_case     )  ->						Any:


   '''simple docstring'''







   if a < b:
      __A				 =       b, a

   while a % b != 0:
      __A				 =       b, a % b

   return b


if __name__ == "__main__":
     from doctest import testmod

     testmod(name="""modular_division""", verbose=True)
     testmod(name="""modular_division2""", verbose=True)
     testmod(name="""invert_modulo""", verbose=True)
     testmod(name="""extended_gcd""", verbose=True)
     testmod(name="""extended_euclid""", verbose=True)
     testmod(name="""greatest_common_divisor""", verbose=True)








def 				__UpperCamelCase  (		snake_case = 1_0_0     )  ->						int:


   '''simple docstring'''







   __A				 =       [[0 for _ in range(snake_case     )] for _ in range(m + 1     )]
   for i in range(m + 1     ):
      __A				 =       1

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

