#pragma optimise "i'll_die_virgin"
#include <bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
#if __cplusplus >= 202002L
using namespace numbers;
#endif


int arr[] ={6,                // 2^1 * (2^2 - 1)
        28,               // 2^2 * (2^3 - 1)
        496,              // 2^4 * (2^5 - 1)
        8128,             // 2^6 * (2^7 - 1)
        33550336,         // 2^12 * (2^13 - 1)
        8589869056,       // 2^16 * (2^17 - 1)
        137438691328,     // 2^18 * (2^19 - 1)
        2305843008139952128};


int32_t main(){
    cin.tie(0)->sync_with_stdio(0);
    //freopen("err.txt","w",stderr);
    cin.exceptions(ios::badbit | ios::failbit);
    auto __solve_tc = [&](auto __tc_num)->void{
        int n;
        cin>>n;
        for(auto it: arr){
            if(it == n){
                cout<<"Yes"<<endl;
                return;
            }
        }
        cout<<"No"<<endl;
        
    };
    int __tc_cnt = 1;
    // cin >> __tc_cnt;
    for(auto __tc_num = 0; __tc_num < __tc_cnt; ++ __tc_num){
        __solve_tc(__tc_num);
    }
    return 0;
}

/*

*/