from collections import defaultdict

def prime_factorize(n): # O(√n)
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a

def M(n):
    return 2**n - 1

N = int(input())

memo = defaultdict(int)
for i in range(2, N + 1):
    #sojo *= M(i)
    primes = prime_factorize(M(i))
    for prime in primes:
        memo[prime] += 1

memo2 = defaultdict(int)
primes = prime_factorize(M(N + 1))
for prime in primes:
    memo2[prime] += 1

# 任意のprimeについて
# memo2[prime] <= memo[prime] が成り立つか？
for prime, cnt in memo2.items():
    if cnt > memo[prime]:
        exit(print('No'))
print('Yes')