# modified from https://judge.yosupo.jp/submission/205424
from random import randrange


def is_prime(n):
    if n < 2:
        return False
    if n == 2 or n == 3:
        return True
    if n % 2 == 0:
        return False

    s, d = 0, n - 1
    while d % 2 == 0:
        d >>= 1
        s += 1

    bases = []
    while len(bases) < 3:
        a = randrange(2, n - 1)
        if a >= n:
            continue
        bases.append(a)

    for a in bases:
        x = pow(a, d, n)
        if x == 1 or x == n - 1:
            continue

        for _ in range(s - 1):
            x = pow(x, 2, n)
            if x == n - 1:
                break
        else:
            return False
    return True


def main():
    import io, os

    # input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline

    S = input()
    if len(S) <= 18:
        N = int(S)
        f = 1 - (N % 2)
        N += f
        ans = "Yes" if is_prime(N) else "No"
    else:
    	f = int(S[-1]) % 2
    	ans = "No"
    print(f)
    print(ans)


main()