
"""simple docstring"""


import math






def  lowercase						(	lowerCAmelCase__						):





			if 1 < number < 4:
						# 2 and 3 are primes
						return True
			elif number < 2 or number % 2 == 0 or number % 3 == 0:
						# Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
						return False

			# All primes number are in format of 6k +/- 1
			for i in range(5	,int(math.sqrt(A_						) + 1						)	,6						):
						if number % i == 0 or number % (i + 2) == 0:
									return False
			return True






def  lowercase						(	lowerCAmelCase__ = 0.1						):
			lowerCamelCase_					=  3
			lowerCamelCase_					=  3

			while primes / (2 * j - 1) >= ratio:
						for i in range(j * j + j + 1	,(j + 2) * (j + 2)	,j + 1						):
									primes += is_prime(A_						)
						j += 2
			return j


if __name__ == "__main__":
						import doctest

						doctest.testmod()





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

def a__       (			A_   ):






  '''simple docstring'''





  __magic_name__								=			prime_factors(A_   )
  if is_square_free(A_   ):
    return -1 if len(A_   ) % 2 else 1
  return 0


if __name__ == "__main__":
    import doctest

    doctest.testmod()

