
from maths.is_square_free import is_square_free
from maths.prime_factors import prime_factors





def      lowerCamelCase_					(							lowerCamelCase__       ):
				lowerCamelCase_         =     prime_factors(lowerCamelCase__       )
				if is_square_free(lowerCamelCase__       ):
								return -1 if len(lowerCamelCase__       ) % 2 else 1
				return 0


if __name__ == "__main__":
			import doctest

			doctest.testmod()









def    _A	(   lowerCamelCase = 200 ):
   a__						:    List[str]   		=	[1, 2, 5, 10, 20, 50, 100, 200]
   a__						:    Dict   		=	[0] * (pence + 1)
   a__						:    int   		=	1  # base case: 1 way to make 0 pence

   for coin in coins:
      for i in range(lowerCamelCase				,			pence + 1				,			1 ):
         number_of_ways[i] += number_of_ways[i - coin]
   return number_of_ways[pence]


if __name__ == "__main__":
  assert solution(2_0_0) == 7_3_6_8_2

