



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

def   _lowerCAmelCase   (						A__	):
      lowercase__     =  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()





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

def   _lowerCAmelCase   (						A__	):
      lowercase__     =  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()
