import collections

def prime(n):
    if n == 1:
        return []
    
    lis = []
    
    while n % 2 == 0:
        lis.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            lis.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        lis.append(n)

    return lis

n = int(input())

if n == 1:
    print(1)
    exit()

nums = collections.Counter(prime(n))

k = 0
for v in nums.values():
    if v >= 2:
        print(0)
        break
    k += 1
else:
    print(-1 ** k)