



def 				UpperCAmelCase__		(					_SCREAMING_SNAKE_CASE :						int = 1_0_0					)->Union[str, Any]:
      _lowerCAmelCase			      =	[[0 for _ in range(__lowerCamelCase					)] for _ in range(m + 1					)]
      for i in range(m + 1					):
            _lowerCAmelCase			      =	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())))




from __future__ import annotations

from collections.abc import Iterable, Iterator
from typing import Any, Generic, TypeVar

_lowerCamelCase         =	TypeVar("""T""", bound=bool)

class    _SCREAMING_SNAKE_CASE						(Generic[T]			):





     def __init__(							self			:				List[Any]  ,	UpperCamelCase			:				T					)->None:
      __SCREAMING_SNAKE_CASE							:     T							=						value
      __SCREAMING_SNAKE_CASE							:     SkewNode[T] | None							=						None
      __SCREAMING_SNAKE_CASE							:     SkewNode[T] | None							=						None





     @property
     def 						__snake_case     (							self			:				Dict					)->T:
      return self._value






     @staticmethod
     def 						__snake_case     (							UpperCamelCase			:				SkewNode[T] | None  ,	UpperCamelCase			:				SkewNode[T] | None					)->SkewNode[T] | None:
      if not roota:
       return roota

      if not roota:
       return roota

      if roota.value > roota.value:
       __SCREAMING_SNAKE_CASE,		__SCREAMING_SNAKE_CASE							:     List[Any]							=						roota, roota

      __SCREAMING_SNAKE_CASE							:     int							=						roota
      __SCREAMING_SNAKE_CASE							:     str							=						roota.right
      __SCREAMING_SNAKE_CASE							:     int							=						roota.left
      __SCREAMING_SNAKE_CASE							:     Optional[int]							=						SkewNode.merge(UpperCamelCase  ,	UpperCamelCase					)

      return result






class    _SCREAMING_SNAKE_CASE						(Generic[T]			):





     def __init__(							self			:				str  ,	UpperCamelCase			:				Iterable[T] | None = ()					)->None:
      __SCREAMING_SNAKE_CASE							:     SkewNode[T] | None							=						None
      if data:
       for item in data:
        self.insert(UpperCamelCase					)





     def __bool__(							self			:				str					)->bool:
      return self._root is not None





     def __iter__(							self			:				Any					)->Iterator[T]:
      __SCREAMING_SNAKE_CASE							:     list[Any]							=						[]
      while self:
       result.append(self.pop()					)

      # Pushing items back to the heap not to clear it.
      for item in result:
       self.insert(UpperCamelCase					)

      return iter(UpperCamelCase					)





     def 						__snake_case     (							self			:				List[Any]  ,	UpperCamelCase			:				T					)->None:
      __SCREAMING_SNAKE_CASE							:     str							=						SkewNode.merge(self._root  ,	SkewNode(UpperCamelCase					)					)





     def 						__snake_case     (							self			:				List[Any]					)->T | None:
      __SCREAMING_SNAKE_CASE							:     Any							=						self.top()
      __SCREAMING_SNAKE_CASE							:     List[Any]							=						(
          SkewNode.merge(self._root.left  ,	self._root.right					) if self._root else None
      )

      return result





     def 						__snake_case     (							self			:				Optional[int]					)->T:
      if not self._root:
       raise IndexError("Can't get top element for the empty heap."					)
      return self._root.value






     def 						__snake_case     (							self			:				Dict					)->None:
      __SCREAMING_SNAKE_CASE							:     Optional[Any]							=						None


if __name__ == "__main__":
      import doctest

      doctest.testmod()






