#include <bits/stdc++.h>
using namespace std;

typedef int uci;
#define int long long
#define F first
#define S second
#define ar array

void solve(){
    int n;
    cin >> n;

    if(n == 1) {
        cout << "YES\n1\n"; return;
    }

    if(n == 3) {
        cout << "YES\n1 3 2\n"; return;
    }

    if(n == 7) {
        cout << "YES\n4 5 7 6 2 3 1\n"; return;
    }


    int mg  = 1;
    while(n >= (1 << mg)) mg++;
    mg--;

    if(n >> (mg - 2) != 0b111) {
        cout << "NO\n";
        return;
    }

    vector<int> v;
    v.push_back(1);
    for(int i{2}; i <= mg-2; ++i){
        vector<int> ne;
        ne.push_back(1<<(i-1));
        for(int j = v.size()-1; j >= 0; --j){
            ne.push_back((1<<(i-1)) | v[j]);
        }
        for(int i : v)
            ne.push_back(i);
        v.swap(ne);
    }

    v.insert(v.begin(),0LL);


    vector<int> res;

    int shft = mg - 2;

    for(auto x: v) res.push_back((0b101 << shft) | x);
    bool f = false;
    for(auto x: v) {
        int hi = (0b111 << shft) | x;
        if(hi <= n) res.push_back((0b111 << shft) | x);
        vector<int> seq = {1,3,2,6,4};
        if(f) reverse(seq.begin(), seq.end());
        f = !f;
        for(auto s: seq) res.push_back((s << shft) | x);
    }

    reverse(v.begin(), v.end());
    for(auto x: v) if(x) res.push_back(x);
    
    /*cout << "DBG\n";
    for(auto x: res) {
        bitset<10> b(x);
        cout << b << endl;
    }*/

    //set<int> S;
    //for(auto x: res) S.insert(x);
    //cout << S.size() << endl;

    cout << "YES\n";
    for(int i : res)
        cout << i << ' ';
    cout << '\n';
}

uci main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    solve();
}