
"""simple docstring"""





def       lowerCamelCase__		(			__snake_case	)							->		int:


					"""simple docstring"""





					return 1 if digit in (0, 1) else (digit * factorial(digit - 1	))



def       lowerCamelCase__		(			__snake_case	)							->		bool:


					"""simple docstring"""





					_UpperCamelCase							 =  0
					_UpperCamelCase							 =  number
					while duplicate > 0:
										_UpperCamelCase ,  _UpperCamelCase							 =  divmod(__snake_case,     10	)
										fact_sum += factorial(__snake_case	)
					return fact_sum == number


if __name__ == "__main__":
				print("""Program to check whether a number is a Krisnamurthy Number or not.""")
				_a														=		int(input("""Enter number: """).strip())
				print(
				    F"""{number} is {"" if krishnamurthy(number) else "not "}a Krishnamurthy Number."""
				)








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






