
"""simple docstring"""





from maths.prime_factors import prime_factors



def       lowerCamelCase__		(			__snake_case	)							->		int:


					"""simple docstring"""





					if not isinstance(__snake_case,     __snake_case	):
										_UpperCamelCase							 =  F'''Input value of [number={number}] must be an integer'''
										raise TypeError(__snake_case	)
					if number < 1:
										raise ValueError('''Input must be a positive integer'''	)
					return -1 if len(prime_factors(__snake_case	)	) % 2 else 1


if __name__ == "__main__":
				import doctest

				doctest.testmod()








"""simple docstring"""





from graphs.minimum_spanning_tree_kruskal import kruskal



def       lowerCamelCase__		(			)							->		List[Any]:


					"""simple docstring"""





					_UpperCamelCase							 =  9
					_UpperCamelCase							 =  [
					    [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],
					]

					_UpperCamelCase							 =  kruskal(__snake_case,     __snake_case	)

					_UpperCamelCase							 =  [
					    [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(__snake_case	) == sorted(__snake_case	)






