#!/usr/bin/python2
# -*- coding: utf-8 -*-
# †

def f(n):
    return 2*n - bin(2*n)[2:].count('1')


n = int(raw_input())

lo, hi = 0, 10**20

while hi - lo > 1:
    md = (lo + hi) / 2
    if f(md) <= n:
        lo = md
    else:
        hi = md

res = 'YES' if f(lo) == n else 'NO'
print res