#include using namespace std; #include using namespace atcoder; #ifdef DEFINED_ONLY_IN_LOCAL #include #define dump(...) cpp_dump(__VA_ARGS__) #else #undef dump #define dump(...) #endif #define rep1(i, a) for (int i = 0; i < (int)(a); i++) #define rep2(i, a, b) for (int i = (int)(a); i < (int)(b); i++) #define rep3(i, a, b, c) for (int i = (int)(a); i < (int)(b); i += (int)(c)) #define overloadRep(a, b, c, d, e, ...) e #define rep(...) overloadRep(__VA_ARGS__, rep3, rep2, rep1)(__VA_ARGS__) #define rrep(i, a, b) for (int i = (int)(a); i <= (int)(b); i++) #define drep(i, a, b) for (int i = (int)(a); i >= (int)(b); i--) #define all(a) a.begin(), a.end() #define rall(a) a.rbegin(), a.rend() using ll = long long; using ull = unsigned long long; using P = pair; using T = tuple; const int inf = 1e9; const ll INF = 1e18; const int dx[4] = {0, 1, 0, -1}; const int dy[4] = {1, 0, -1, 0}; struct cincout { cincout() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(15); } } init; template inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } template istream &operator>>(istream &is, vector &v) { for (T &in : v) { is >> in; } return is; } template ostream &operator<<(ostream &os, const vector &v) { rep(i, (int)v.size()) { os << v[i] << " \n"[i + 1 == (int)v.size()]; } return os; } template istream &operator>>(istream &is, vector> &vv) { for (vector &v : vv) { is >> v; } return is; } template ostream &operator<<(ostream &os, vector> &vv) { for (vector &v : vv) { os << v; } return os; } template istream &operator>>(istream &is, pair &p) { is >> p.first >> p.second; return is; } template ostream &operator<<(ostream &os, const pair &p) { os << p.first << " " << p.second << '\n'; return os; } bool bit(ll x, int p) { return (x >> p) & 1; } bool out(int ni, int nj, int h, int w) { return (ni < 0 or ni >= h or nj < 0 or nj >= w); } int pc(ll x) { return __builtin_popcountll(x); } int main(){ int n; cin >> n; ll mod = (1LL << (n + 1)) - 1; ll x = 1; for (int i = 2; i <= n; i++) { x *= (1LL << i) - 1; //dump((1 << i) - 1); x %= mod; } //dump(x, mod); cout << (x == 0 ? "Yes" : "No") << endl; return 0; }