from math import ceil, sqrt
def Sieve(n):
    lst = [True] * (n + 1)
    lst[0] = lst[1] = False
    S = set()
    for i in range(2, ceil(sqrt(n)) + 1):
        if lst[i]:
            for j in range(2 * i, n + 1, i):
                lst[j] = False
    for i in range(2, n + 1):
        if lst[i]:
            S.add(i)
    return S

SS = Sieve(10**6 + 5)

S = set()
for i in range(2, 20):
    if 2**i - 1 in SS:
        S.add(2**(i-1) * (2**i - 1))
print("Yes") if int(input()) in S else print("No")