

# 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							(		a__):

			'''simple docstring'''



			a_		:		Tuple				    =				Queue()
			a_		:		str				    =				[False] * len(a__)
			a_		:		Optional[int]				    =				[-1] * len(a__)

			def bfs():
						while not queue.empty():
									a_		:		Dict				    =				queue.get()
									a_		:		Optional[int]				    =				True

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

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

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

						return True

			for i in range(len(a__)):
						if not visited[i]:
									queue.put(a__)
									a_		:		List[Any]				    =				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]}))









def 			_UpperCAmelCase							(		a__):

			'''simple docstring'''



			return 1 if input_a == 0 else 0


def 			_UpperCAmelCase							(		):

			'''simple docstring'''



			assert not_gate(0) == 1
			assert not_gate(1) == 0


if __name__ == "__main__":
	print(not_gate(0))
	print(not_gate(1))


