
"""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.
def     __lowerCAmelCase				(_UpperCamelCase		):
	__lowerCAmelCase			:						Any									=      [False] * len(_UpperCamelCase		)
	__lowerCAmelCase			:						int									=      [-1] * len(_UpperCamelCase		)

	def dfs(_UpperCamelCase       ,  _UpperCamelCase		):
		__lowerCAmelCase			:						Optional[int]									=      True
		__lowerCAmelCase			:						Any									=      c
		for u in graph[v]:
			if not visited[u]:
				dfs(_UpperCamelCase       ,  1 - c		)

	for i in range(len(_UpperCamelCase		)		):
		if not visited[i]:
			dfs(_UpperCamelCase       ,  0		)

	for i in range(len(_UpperCamelCase		)		):
		for j in graph[i]:
			if color[i] == color[j]:
				return False

	return True


# Adjacency list of graph
lowerCamelCase__   					=		{0: [1, 3], 1: [0, 2], 2: [1, 3], 3: [0, 2], 4: []}
print(check_bipartite_dfs(graph))






def  _SCREAMING_SNAKE_CASE				(   a					,						a  )      ->      list[int]:
					__A	:						Optional[int]       =				int(a  )

					# Initialize Result
					__A	:						Optional[int]       =				[]

					# Traverse through all denomination
					for denomination in reversed(a  ):
										# Find denominations
										while int(a  ) >= int(a  ):
															total_value -= int(a  )
															answer.append(a  )  # Append the "answers" array

					return answer


# Driver Code
if __name__ == "__main__":
				UpperCAmelCase						:   List[str]			  =     []
				UpperCAmelCase						:   Optional[int]			  =     '''0'''

				if (
				    input('''Do you want to enter your denominations ? (yY/n): ''').strip().lower()
				    == "y"
				):
								UpperCAmelCase						:   List[Any]			  =     int(input('''Enter the number of denominations you want to add: ''').strip())

								for i in range(0, n):
												denominations.append(int(input(F"""Denomination {i}: """).strip()))
								UpperCAmelCase						:   int			  =     input('''Enter the change you want to make in Indian Currency: ''').strip()
				else:
								# All denominations of Indian Currency if user does not enter
								UpperCAmelCase						:   Optional[int]			  =     [1, 2, 5, 10, 20, 50, 1_00, 5_00, 20_00]
								UpperCAmelCase						:   Tuple			  =     input('''Enter the change you want to make: ''').strip()

				if int(value) == 0 or int(value) < 0:
								print('''The total value cannot be zero or negative.''')

				else:
								print(F"""Following is minimal change for {value}: """)
								UpperCAmelCase						:   Optional[int]			  =     find_minimum_change(denominations, value)
								# Print result
								for i in range(len(answer)):
												print(answer[i], end=''' ''')




