






def      __A					(     _lowercase ):

     '''simple docstring'''







     _A								= [[0 for _ in range(_lowercase )] for _ in range(m + 1 )]
     for i in range(m + 1 ):
          _A								= 1

     for n in range(m + 1 ):
          for k in range(1					,			_lowercase ):
               memo[n][k] += memo[n][k - 1]
               if n - k > 0:
                    memo[n][k] += memo[n - k - 1][k]

     return memo[m][m - 1]


if __name__ == "__main__":
    import sys

    if len(sys.argv) == 1:
        try:
            __A      =				int(input('Enter a number: ').strip())
            print(partition(n))
        except ValueError:
            print('Please enter a number.')
    else:
        try:
            __A      =				int(sys.argv[1])
            print(partition(n))
        except ValueError:
            print('Please pass a number.')











def      __A					(     _lowercase ):

					'''simple docstring'''







					_A								= [0] * len(_lowercase )
					_A								= []
					_A								= []
					_A								= 0

					for values in graph.values():
										for i in values:
															indegree[i] += 1

					for i in range(len(_lowercase ) ):
										if indegree[i] == 0:
															queue.append(_lowercase )

					while queue:
										_A								= queue.pop(0 )
										cnt += 1
										topo.append(_lowercase )
										for x in graph[vertex]:
															indegree[x] -= 1
															if indegree[x] == 0:
																				queue.append(_lowercase )

					if cnt != len(_lowercase ):
										print('''Cycle exists''' )
					else:
										print(_lowercase )


# Adjacency List of Graph
__A      =				{0: [1, 2], 1: [3], 2: [3], 3: [4, 5], 4: [], 5: []}


topological_sort(graph)



