from sys import stdin
from math import sqrt

n = int(stdin.readline())

res = False

def is_prime(num):
    if num <= 1:
        return False
    elif num <= 3:
        return True
    elif num % 2 == 0 or n % 3 == 0:
        return False
    i = 5
    while i * i <= num:
        if num % i == 0 or num % (i + 2) == 0:
            return False
        i += 6
    return True

for i in range(1, 31):
	if (2 ** (i - 1)) * (2 ** i - 1) == n and is_prime(i):
		res = True
		break

if res:
	print("Yes")
else:
	print("No")