def f(n):
    def ok(k,s,n):
        if s==n: return True
        L = R = s
        for i in range(35):
            L += 2*k
            R += 2*k+(2**(i+1)-1)
            if L <= n <= R:
                return True
            if n < L:
                return False
            k *= 2
        return False
    
    if n <= 1: return True
    k = s = 1
    cc = 0
    while True:
        if s == n: return True
        if s > n: return False
        for c in range(2):
            kk = 2*k+c
            if ok(kk,s+kk,n):
                k = kk
                s += kk
                break
        else:
            return False

n = int(input())
print("YES" if f(n) else "NO")