



"""simple docstring"""





def 	UpperCAmelCase     (		A	:						Tuple       ):

		'''simple docstring'''


		return [
		    {
		        0: [1, 2],
		        1: [0, 2],
		        2: [0, 1, 3, 5],
		        3: [2, 4],
		        4: [3],
		        5: [2, 6, 8],
		        6: [5, 7],
		        7: [6, 8],
		        8: [5, 7],
		    },
		    {
		        0: [6],
		        1: [9],
		        2: [4, 5],
		        3: [4],
		        4: [2, 3],
		        5: [2],
		        6: [0, 7],
		        7: [6],
		        8: [],
		        9: [1],
		    },
		    {
		        0: [4],
		        1: [6],
		        2: [],
		        3: [5, 6, 7],
		        4: [0, 6],
		        5: [3, 8, 9],
		        6: [1, 3, 4, 7],
		        7: [3, 6, 8, 9],
		        8: [5, 7],
		        9: [5, 7],
		    },
		    {
		        0: [1, 3],
		        1: [0, 2, 4],
		        2: [1, 3, 4],
		        3: [0, 2, 4],
		        4: [1, 2, 3],
		    },
		][index]




def 	UpperCAmelCase     (		A	:						dict[int, list[int]]       ):

		'''simple docstring'''


		_UpperCAmelCase							 =		0
		_UpperCAmelCase							 =		len(A       )  # No of vertices in graph
		_UpperCAmelCase							 =		[0] * n
		_UpperCAmelCase							 =		[False] * n

		def dfs(A	:						Dict     ,				A	:						List[Any]     ,				A	:						Any     ,				A	:						Any       ):
				_UpperCAmelCase							 =		True
				_UpperCAmelCase							 =		id_
				id_ += 1
				for to in graph[at]:
						if to == parent:
								pass
						elif not visited[to]:
								dfs(A     ,				A     ,				A     ,				id_       )
								_UpperCAmelCase							 =		min(low[at]     ,				low[to]       )
								if id_ <= low[to]:
										bridges.append((at, to) if at < to else (to, at)       )
						else:
								# This edge is a back edge and cannot be a bridge
								_UpperCAmelCase							 =		min(low[at]     ,				low[to]       )

		_UpperCAmelCase							 =		[]
		for i in range(A       ):
				if not visited[i]:
						dfs(A     ,				-1     ,				A     ,				id_       )
		return bridges


if __name__ == "__main__":
					import doctest

					doctest.testmod()







"""simple docstring"""





def 	UpperCAmelCase     (		A	:						int       ):

		'''simple docstring'''


		_UpperCAmelCase							 =		[[0 for _ in range(A       )] for _ in range(m + 1       )]
		for i in range(m + 1       ):
				_UpperCAmelCase							 =		1

		for n in range(m + 1       ):
				for k in range(1     ,				A       ):
						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:
															lowercase  							=					int(input('''Enter a number: ''').strip())
															print(partition(n))
										except ValueError:
															print('''Please enter a number.''')
					else:
										try:
															lowercase  							=					int(sys.argv[1])
															print(partition(n))
										except ValueError:
															print('''Please pass a number.''')


