






from math import factorial





def 					snake_case	(  lowerCamelCase					,	lowerCamelCase       ):




	'''simple docstring'''







	if n < k or k < 0:
		raise ValueError("""Please enter positive integers for n and k where n >= k"""       )
	return factorial(lowerCamelCase       ) // (factorial(lowerCamelCase       ) * factorial(n - k       ))


if __name__ == "__main__":
						print(
						    """The number of five-card hands possible from a standard""",
						    F'''fifty-two card deck is: {combinations(52, 5)}\n''',
						)

						print(
						    """If a class of 40 students must be arranged into groups of""",
						    F'''4 for group projects, there are {combinations(40, 4)} ways''',
						    """to arrange them.\n""",
						)

						print(
						    """If 10 teams are competing in a Formula One race, there""",
						    F'''are {combinations(10, 3)} ways that first, second and''',
						    """third place can be awarded.""",
						)





from maths.prime_factors import prime_factors



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


if __name__ == "__main__":
 import doctest

 doctest.testmod()


