#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <unordered_map>
#include <chrono>
#include <random>
#include <functional>
#include <utility>
#include <cassert>
#pragma GCC optimize("O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma comment(linker, "STACK:36777216")
using namespace std;
using i64 = int64_t;
constexpr i64 MOD = 1e9 + 7;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
using vi = vector<i64>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using ii = pair<i64, i64>;

bool exist(int n, int k) {
    // k exist in tree with root n
    if (n == k) return true;
    int lsum = n, l = n, rsum = n, r = n;
    while (1) {
        if (k < lsum) return false;
        lsum += l * 2;
        l = l * 2;
        rsum += r * 2 + 1;
        r = r * 2 + 1;
        if (lsum <= k && k <= rsum) {
            return exist(n * 2, k - n) || exist(n * 2 + 1, k - n);
        }
    }
}

int main() {
    int n;
    cin >> n;
    cout << ((n == 0 || exist(1, n)) ? "YES" : "NO") << endl;
}