from sys import stdin
from math import sqrt

n = int(stdin.readline())

# 素因数分解をする
def prime_factorization_multi(num):
    divisors = {}
    for prime in range(2, num + 1):
        expon = 0
        while (num % prime) == 0:
            expon += 1
            num //= prime
        if expon != 0:
            divisors[prime] = expon
    return divisors
  
# 素因数分解の結果から約数和を出す
def get_divisors_sum(divisors):
	res = 1
	for d, p in divisors.items():
		n = (d ** (p + 1) - 1) // (d - 1)
		res *= n
	return res

divs = prime_factorization_multi(n)

if get_divisors_sum(divs) == (2 * n):
	print("Yes")
else:
	print("No")