#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< ")";}
template<class T>void pv(T a,T b){for(T i=a;i!=b;++i)cout<<(*i)<<" ";cout<<endl;}
template<class T>void chmin(T&a,const T&b){if(a>b)a=b;}
template<class T>void chmax(T&a,const T&b){if(a<b)a=b;}

ll f(ll n) {
  ll res = 0;
  while (n > 0) {
    res += n;
    n /= 2;
  }
  return res;
}

int main() {

  ll N; cin >> N;

  ll lo = -1;
  ll hi = 1e9;
  while (hi - lo > 1) {
    ll mid = (hi + lo) / 2;
    if (f(mid) >= N) hi = mid; else lo = mid;
  }

  if (f(hi) == N) cout << "YES" << endl;
  else cout << "NO" << endl;

  return 0;
}