
"""simple docstring"""

def       lowercase__  (   lowerCAmelCase			:   int = 100	)	-> int:






     """simple docstring"""




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





"""simple docstring"""

SCREAMING_SNAKE_CASE_         =  {
    0: '''underwear''',
    1: '''pants''',
    2: '''belt''',
    3: '''suit''',
    4: '''shoe''',
    5: '''socks''',
    6: '''shirt''',
    7: '''tie''',
    8: '''watch''',
}

SCREAMING_SNAKE_CASE_         =  [[1, 4], [2, 4], [3], [], [], [4], [2, 7], [3], []]

SCREAMING_SNAKE_CASE_         =  [0 for x in range(len(graph))]
SCREAMING_SNAKE_CASE_         =  []




def       lowercase__  (   lowerCAmelCase			:   Optional[int]	,			lowerCAmelCase			:   Any	)	-> List[str]:






    """simple docstring"""




    UpperCAmelCase       =   1
    while stack:
        UpperCAmelCase       =   stack.pop()
        print(lowerCAmelCase	,			clothes[current_clothing]	)
        order += 1




def       lowercase__  (   lowerCAmelCase			:   List[Any]	,			lowerCAmelCase			:   Any	,			lowerCAmelCase			:   Dict	)	-> Optional[Any]:






    """simple docstring"""




    UpperCAmelCase       =   1
    for v in graph[u]:
        if not visited[v]:
            depth_first_search(lowerCAmelCase	,			lowerCAmelCase	,			lowerCAmelCase	)

    stack.append(lowerCAmelCase	)




def       lowercase__  (   lowerCAmelCase			:   Tuple	,			lowerCAmelCase			:   Dict	)	-> Optional[Any]:






    """simple docstring"""




    for v in range(len(lowerCAmelCase	)	):
        if not visited[v]:
            depth_first_search(lowerCAmelCase	,			lowerCAmelCase	,			lowerCAmelCase	)


if __name__ == "__main__":
   topological_sort(graph, visited)
   print(stack)
   print_stack(stack, clothes)



