
"""simple docstring"""




import math







def       __UpperCAmelCase      (				__UpperCamelCase					):
			__lowercase	:       Dict				=   math.log(2					,							10					) * number
			__lowercase	:       str				=   round((log_number - int(SCREAMING_SNAKE_CASE__					))					,							15					)

			return difference







def       __UpperCAmelCase      (				__UpperCamelCase = 67_89_10					):
			__lowercase	:       Any				=   90
			__lowercase	:       Optional[Any]				=   0

			__lowercase	:       List[str]				=   math.log(1.23					,							10					)
			__lowercase	:       List[str]				=   math.log(1.24					,							10					)
			__lowercase	:       List[str]				=   0

			while position < number:
						__lowercase	:       List[Any]				=   log_difference(SCREAMING_SNAKE_CASE__					)

						if difference >= upper_limit:
									power_iterator += 93

						elif difference < lower_limit:
									power_iterator += 1_96

						else:
									__lowercase	:       str				=   power_iterator
									power_iterator += 1_96
									position += 1

			return previous_power


if __name__ == "__main__":
			import doctest

			doctest.testmod()

			print(F"{solution() = }")









"""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]}))



