#素因数分解
def Prime_Factorization(n):
    R=[]
    N=n

    for k in range(2,int(-(-n**0.5//1))+1):
        if N%k==0:
            C=0
            while N%k==0:
                C+=1
                N//=k
            R.append([k,C])

    if N!=1:
        R.append([N,1])
        
    if not R:
        R.append([N,1])

    return R

#平方数?
def Is_Square_Number(N):
    H=Prime_Factorization(N)

    for (_,x) in H:
        if x%2:
            return False
    return True

n=int(input())
if Is_Square_Number(8*n+1):
    H=Prime_Factorization(8*n+1)

    s=1
    for (c,k) in H:
        s*=c**(k//2)
    print("YES")
    print((s-1)//2)
else:
    print("NO")