#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define reps(i, l, r) for(ll i = (l); i < (r); i++)
#define all(a) (a).begin(), (a).end()
#define endl "\n";
const ll INF = 2e18;
const ll mod1 = 1000000007;
const ll mod2 = 998244353;
ll dx[4] = {-1, 0, 1, 0};
ll dy[4] = {0, -1, 0, 1};
void chmin(ll& a, ll b){ if(a > b) a = b; }
void chmax(ll& a, ll b){ if(a < b) a = b; }
void solve() {
  ll N; cin >> N;
  if (N == 6 || N == 28 || N == 496 || N == 8128 || N == 33550336 || N == 8589869056 || N == 137438691328 || N == 2305843008139952128) {
    cout << "Yes" << endl;
  }
  else cout << "No" << endl;
}
signed main() {
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  ll T = 1; //cin >> T;
  while (T--) solve();
}