#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>

using namespace std;
typedef long long ll;

int N;

int calc(int n){
    int ans = 1;
    int tmp = 1;
    int d;
    if(n == 1) return 1;
    for(int i = 0; i <= 30; i++){
        int m = 1<<i;
        if(2*m > n) break;
        d = i;
    }
    for(int i = d; i >= 0; i--){
        int m = 1<<i;
        if(m&n) tmp = tmp*2+1;
        else tmp = tmp*2;
        ans += tmp;
    }
    return ans;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    cin >> N;
    if(N <= 1){
        cout << "YES" << endl;
        return 0;
    }
    int l = 1, r = N;
    while(r-l > 1){
        int c = (l+r)/2;
        if(calc(c) > N) r = c;
        else l = c;
    }
    if(calc(l) == N){
        cout << "YES" << endl;
    }else{
        cout << "NO" << endl;
    }
}