from graphs.minimum_spanning_tree_kruskal import kruskal





def  __lowerCamelCase     (			):







							'''simple docstring'''






							snake_case_          =   9
							snake_case_          =   [
							    [0, 1, 4],
							    [0, 7, 8],
							    [1, 2, 8],
							    [7, 8, 7],
							    [7, 6, 1],
							    [2, 8, 2],
							    [8, 6, 6],
							    [2, 3, 7],
							    [2, 5, 4],
							    [6, 5, 2],
							    [3, 5, 14],
							    [3, 4, 9],
							    [5, 4, 10],
							    [1, 7, 11],
							]

							snake_case_          =   kruskal(a_       ,							a_				)

							snake_case_          =   [
							    [7, 6, 1],
							    [2, 8, 2],
							    [6, 5, 2],
							    [0, 1, 4],
							    [2, 5, 4],
							    [2, 3, 7],
							    [0, 7, 8],
							    [3, 4, 9],
							]

							assert sorted(a_				) == sorted(a_				)







def  __lowerCamelCase     (			UpperCamelCase__       ,							UpperCamelCase__				):







							'''simple docstring'''






							return int((input_a, input_a).count(0				) != 0				)





def  __lowerCamelCase     (			):







							'''simple docstring'''






							assert nand_gate(0       ,							0				) == 1
							assert nand_gate(0       ,							1				) == 1
							assert nand_gate(1       ,							0				) == 1
							assert nand_gate(1       ,							1				) == 0


if __name__ == "__main__":
					print(nand_gate(0, 0))
					print(nand_gate(0, 1))
					print(nand_gate(1, 0))
					print(nand_gate(1, 1))




