def is_prime(x):
    if x < 2:
        return (False)
    elif x == 2 or x == 3:
        return True
    else:
        for n in range(2,(x -1)):
            if x % n == 0:
                return False
            else:
                return True

        for n in range(2, (x - 1)):
            if x % n == 0:
                return False
            else:
                return True

def is_prime(n):
    return ~ -2**n % n < 2
print(is_prime(int(input())))

[1, 341, 561, 645, 1105, 1387, 1729, 1905, 2047, 2465, 2701, 2821, 3277, 4033, 4369, 4371, 4681, 5461, 6601, 7957, 8321, 8481, 8911]