def divisors(M):#Mの約数列 O(n^(0.5+e))
    import math
    d=[]
    i=1
    while math.sqrt(M)>=i:
        if M%i==0:
            d.append(i)
            if i**2!=M:
                d.append(M//i)
        i=i+1
    d.sort()
    return d

A = int(input())
div = divisors(2*A)
for k in div:
    if k<3:
        continue
    S = (2*A)//k - k + 1
    if S%2==0:
        exit(print("YES"))

print("NO")