



from doctest import testmod
from math import sqrt


def 						_UpperCAmelCase							( snake_case     ):





					"""simple docstring"""

					_lowerCAmelCase         =       []
					if num < 1:
										return facs
					facs.append(1     )
					if num == 1:
										return facs
					facs.append(snake_case     )
					for i in range(2      ,		int(sqrt(snake_case     )     ) + 1     ):
										if num % i == 0:  # If i is a factor of num
															facs.append(snake_case     )
															_lowerCAmelCase         =       num // i  # num//i is the other factor of num
															if d != i:  # If d and i are distinct
																				facs.append(snake_case     )  # we have found another factor
					facs.sort()
					return facs


if __name__ == "__main__":
	testmod(name="""factors_of_a_number""", verbose=True)








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





					"""simple docstring"""

					_lowerCAmelCase         =       Queue()
					_lowerCAmelCase         =       [False] * len(snake_case     )
					_lowerCAmelCase         =       [-1] * len(snake_case     )

					def bfs():
										while not queue.empty():
															_lowerCAmelCase         =       queue.get()
															_lowerCAmelCase         =       True

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

																				if color[neighbour] == -1:
																									_lowerCAmelCase         =       1 - color[u]
																									queue.put(snake_case     )

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

										return True

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



