#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <deque>
#include <queue>
#include <array>
#include <set>
#include <map>
#include <cmath>
#include <algorithm>
#include <numeric>
#include <cassert>
#include <utility>
#include <tuple>
#include <functional>
#include <bitset>
#include <cstdint>

using namespace std;
using i64 = int64_t;
using i32 = int32_t;
template<class T, class U> void init_n(vector<T>& v, size_t n, U x) 
{ v = vector<T>(n, x); }
template<class T> void init_n(vector<T>& v, size_t n) { init_n(v, n, T()); }
template<class T> void read_n(vector<T>& v, size_t n, size_t o = 0) 
{ v = vector<T>(n+o); for (size_t i=o; i<n+o; ++i) cin >> v[i]; }
template<class T> void read_n(T a[], size_t n, size_t o = 0)
{ for (size_t i=o; i<n+o; ++i) cin >> a[i]; }
template<class T> T gabs(const T& x) { return max(x, -x); }
#define abs gabs

i64 f(i64 x) {
  i64 y = 0;
  for (; x > 0; x >>= 1) y += x;
  return y;
}

int main() {
  i64 n;
  cin >> n;
  if (n == 0) { cout << "YES\n"; return 0; }
  i64 l = 0, r = 2 * n;
  while (r - l >= 2) {
    i64 x = l + (r - l) / 2;
    i64 y = f(x);
    if (y < n) l = x; 
    else if (y > n) r = x;
    else { cout << "YES\n"; return 0; }
    cerr << x << '\t' << y << endl;
  }
  cout << "NO\n";
  return 0;
}