




"""simple docstring"""




def       __UpperCAmelCase      (				__UpperCamelCase = 1_00					):
			__lowercase	:       Tuple				=   [[0 for _ in range(__UpperCamelCase					)] for _ in range(m + 1					)]
			for i in range(m + 1					):
						__lowercase	:       Optional[Any]				=   1

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




# A Bipartite Graph is a graph whose vertices can be divided into two independent sets,
# U and V such that every edge (u, v) either connects a vertex from U to V or a vertex
# from V to U. In other words, for every edge (u, v), either u belongs to U and v to V,
# or u belongs to V and v to U. We can also say that there is no edge that connects
# vertices of same set.
from queue import Queue







def       __UpperCAmelCase      (				__UpperCamelCase					):
			__lowercase	:       int				=   Queue()
			__lowercase	:       str				=   [False] * len(__UpperCamelCase					)
			__lowercase	:       str				=   [-1] * len(__UpperCamelCase					)

			def bfs():
						while not queue.empty():
									__lowercase	:       int				=   queue.get()
									__lowercase	:       List[str]				=   True

									for neighbour in graph[u]:
												if neighbour == u:
															return False

												if color[neighbour] == -1:
															__lowercase	:       str				=   1 - color[u]
															queue.put(__UpperCamelCase					)

												elif color[neighbour] == color[u]:
															return False

						return True

			for i in range(len(__UpperCamelCase					)					):
						if not visited[i]:
									queue.put(__UpperCamelCase					)
									__lowercase	:       int				=   0
									if bfs() is False:
												return False

			return True


if __name__ == "__main__":
			# Adjacency List of graph
			print(check_bipartite({0: [1, 3], 1: [0, 2], 2: [1, 3], 3: [0, 2]}))



