from math import sqrt
def factorization(n):
    factors = []
    if n < 1:
        return [-1]
    elif not isinstance(n, int):
        return [-1]
    elif n == 1:
        return [1]
    n1 = n
    for i in range(2, int(sqrt(n))+1):
        if n1 % i == 0:
            while n1 % i == 0:
                n1//=i
                factors.append(i)
                if n1 == 1:
                    return factors
    if n1 != 1:
        factors.append(n1)
        return factors
    elif factors == []:
        return [n]
n=int(input())
a=factorization(2**(n+1)-1)
for i in range(2,n):
	b=factorization(2**i-1)
	for j in b:
		if j in a:
			a.remove(j)
if a==[]:
	print('Yes')
else:
	print('No')