import sys
import math
import random
sys.set_int_max_str_digits(100000)

def is_prime(n):
    if n == 1:
        return False
    if n == 2:
        return True

    for k in range(3):
        a = random.randint(2, n - 1)

        if math.gcd(n, a) != 1:
            return False

        if pow(a, n - 1, n) != 1:
            return False

    return True

p = int(input())
print(0)
print(is_prime(p))