# https://tjkendev.github.io/procon-library/python/prime/moebius-function.html
# calculate μ(n): O(√N)
def moebius(n):
    x = 2; c = 0
    while x*x <= n:
        if n % x == 0:
            n //= x
            if n % x == 0:
                return 0
            c += 1
        x += 1
    if n > 1:
        c += 1
    return -1 if c % 2 else 1

print(moebius(int(input())))