from collections import defaultdict


def prime_factors(n: int):
    D = defaultdict(int)
    i = 2
    while i*i <= n:
        if n % i:
            i += 1
        else:
            D[i] += 1
            n /= i
    if i > 1:
        D[i] += 1
    return D


N = int(input())
D = defaultdict(int)
for i in range(1, N):
    d = prime_factors((2 << i)-1)
    for p, e in d.items():
        D[p] += e

d = prime_factors((2 << N)-1)
for p, e in d.items():
    if D[p] < e:
        print("No")
        break
else:
    print("Yes")