#include using namespace std; using ll = long long; template using vt = vector; template using vvt = vector>; template using ttt = tuple; using tii = tuple; using vi = vector; #define rep(i,n) for(int i=0;i<(int)(n);i++) #define pb push_back #define mt make_tuple #define ALL(a) (a).begin(),(a).end() #define FST first #define SEC second #define DEB cerr<<"!"<0){if((n&1)==1)r=r*x%m;x=x*x%m;n>>=1;}return r%m;} inline ll lcm(ll d1, ll d2){return d1 / __gcd(d1, d2) * d2;} /*Coding Space*/ int main(){ int n; cin >> n; int t = 1; int s = 0; int sum = 0; while(s+t <= n){ sum += t; s += t; t *= 2; } sum -= t/2; SHOW(s,sum); if(s + sum >= n) cout << "YES" << endl; else cout << "NO" << endl; }