N=int(input())
def prime_factorize(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
factor = []
for i in range(2,N+1):
    factor += prime_factorize(2**i-1)
factor_next = prime_factorize(2**(N+1)-1)
for f in factor_next:
    if f not in factor:
        print("No")
        exit()
print("Yes")