n=int(input())
def enumerate_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5) + 1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i: 
                divisors.append(n // i)
    return sum(divisors)
if 2*n==enumerate_divisors(n):
	print('Yes')
else:
	print('No')