# 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 				_snake_case     (       lowerCAmelCase							:       int     ):
		"""simple docstring"""







		SCREAMING_SNAKE_CASE_  :		Optional[int]    				=   Queue()
		SCREAMING_SNAKE_CASE_  :		Union[str, Any]    				=   [False] * len(lowerCAmelCase     )
		SCREAMING_SNAKE_CASE_  :		int    				=   [-1] * len(lowerCAmelCase     )

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

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

								if color[neighbour] == -1:
										SCREAMING_SNAKE_CASE_  :		Union[str, Any]    				=   1 - color[u]
										queue.put(lowerCAmelCase     )

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

				return True

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

from __future__ import annotations

import sys




def 				_snake_case     (       lowerCAmelCase							:       int     ):
		"""simple docstring"""







		if n < 0:
				raise ValueError("Negative arguments are not supported"     )
		return _fib(lowerCAmelCase     )[0]




def 				_snake_case     (       lowerCAmelCase							:       int     ):
		"""simple docstring"""







		if n == 0:  # (F(0), F(1))
				return (0, 1)

		# F(2n) = F(n)[2F(n+1) − F(n)]
		# F(2n+1) = F(n+1)^2+F(n)^2
		SCREAMING_SNAKE_CASE_				,   SCREAMING_SNAKE_CASE_  :		Dict    				=   _fib(n // 2     )
		SCREAMING_SNAKE_CASE_  :		Optional[Any]    				=   a * (b * 2 - a)
		SCREAMING_SNAKE_CASE_  :		List[str]    				=   a * a + b * b
		return (d, c + d) if n % 2 else (c, d)


if __name__ == "__main__":
		__lowerCamelCase :     str          =  int(sys.argv[1])
		print(f'''fibonacci({n}) is {fibonacci(n)}''')
