import math

def isprime(n):
    if n < 2:
        return False
    if n == 2:
        return True
    if n % 2 == 0:
        return False
    for i in range(3, int(math.sqrt(n)) + 1, 2):
        if n % i == 0: return False
    return True

N = int(input())
n = N
x = 0
while n % 2 == 0:
    x += 1
    n >>= 1
x = 2 ** x
y = 2 * x - 1
if x * y == N:
    if isprime(y):
        print("Yes")
        exit()

print("No")