#include<bits/stdc++.h>
using namespace std;
constexpr int Inf = 2000000000;
constexpr long long INF= 2000000000000000000;

template<typename T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }
template<typename T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }

template<typename T,typename U>
T modpow(T N, U P, T M = -1) {
    if(P < 0) return 0;
    T ret = 1;
    if(M != -1) ret %= M;
    while(P) {
        if(P & 1) {
            if(M == -1) ret *= N;
            else ret = ret * N % M;
        }
        P /= 2;
        if(M == -1) N *= N;
        else N = N * N % M;
    }
    return ret;
}

constexpr long long MOD = 1000000007;

int main() {
    vector<int> fac(31);
    fac[0] = 1;
    for(int i = 1;i < 31;i++) {
        fac[i] = fac[i - 1] + modpow(2,i);
    }

    int n;
    cin >> n;
    for(int i = 30;i >= 0;i--) {
        if(n >= fac[i]) n -= fac[i];
    }

    if(n == 0) cout << "YES" << endl;
    else cout << "NO" << endl;
}