#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=1<<30;

//Union Find


struct UF{
    int n;
    vector<int> par,size,edge;
    
    void init(int n_){
        n=n_;
        par.assign(n,-1);
        size.assign(n,1);
        edge.assign(n,0);
        
        for(int i=0;i<n;i++){
            par[i]=i;
        }
    }
    
    int root(int a){
        if(par[a]==a) return a;
        else return par[a]=root(par[a]);
    }
    
    void unite(int a,int b){
        edge[root(a)]++;
        if(root(a)!=root(b)){
            size[root(a)]+=size[root(b)];
            edge[root(a)]+=edge[root(b)];
            par[root(b)]=root(a);
        }
    }
    
    bool check(int a,int b){
        return root(a)==root(b);
    }
};

void check(vector<int> P){
    return;
    int N=si(P);
    vector<vector<int>> S(N,vector<int>(20));
    for(int i=0;i<N;i++){
        for(int j=0;j<20;j++){
            if(P[i]&(1<<j)) S[i][j]=1;
        }
    }
    UF uf;uf.init(N*20);
    for(int i=0;i<N;i++){
        for(int j=0;j<20;j++){
            if(i+1<N){
                if(S[i][j]&&S[i+1][j]) uf.unite(i*20+j,(i+1)*20+j);
            }
            if(j+1<20){
                if(S[i][j]&&S[i][j+1]) uf.unite(i*20+j,i*20+(j+1));
            }
        }
    }
    set<int> RO;
    for(int i=0;i<N;i++){
        cout<<bitset<20>(P[i])<<endl;
        for(int j=0;j<20;j++){
            if(S[i][j]){
                RO.insert(uf.root(i*20+j));
            }
        }
    }
    assert(si(RO)==1);
}

vector<int> make(int N){
    if(N==1) return {1};
    if(N==3) return {1,3,2};
    if(N==7) return {1,3,2,6,4,5,7};
    vector<int> X={1,3,2,6,4,5,7};
    for(int n=8;n<=400000;n*=2){
        vector<int> Y=X;
        for(int x:Y){
            X.push_back(x|n);
            if(X.back()==n+(n/2)) X.push_back(n);
        }
        
        if(si(X)==N){
            return X;
        }
    }
    return {};
}

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int N;cin>>N;
    if(N==1){
        cout<<"YES\n";
        cout<<1<<"\n";
        return 0;
    }
    if(N==3){
        cout<<"YES\n";
        cout<<"2 3 1\n";
        return 0;
    }
    if(N==13){
        vector<int> ans={1,3,2,6,4,5,7,13,9,11,10,8,12};
        cout<<"YES\n";
        for(int i=0;i<N;i++){
            if(i) cout<<" ";
            cout<<ans[i];
        }
        cout<<"\n";
        check(ans);
        return 0;
    }
    if(N==14){
        vector<int> ans={1,3,2,6,4,5,7,13,9,11,10,8,12,14};
        cout<<"YES\n";
        for(int i=0;i<N;i++){
            if(i) cout<<" ";
            cout<<ans[i];
        }
        cout<<"\n";
        check(ans);
        return 0;
    }
    if(N==15){
        vector<int> ans={1,3,2,6,4,5,7,13,9,11,10,8,12,14,15};
        cout<<"YES\n";
        for(int i=0;i<N;i++){
            if(i) cout<<" ";
            cout<<ans[i];
        }
        cout<<"\n";
        check(ans);
        return 0;
    }
    int k;
    for(int s=30;s>=0;s--){
        if(N&(1<<s)){
            k=s;
            break;
        }
    }
    if(!(N&(1<<(k-1)))){
        cout<<"NO\n";
        return 0;
    }
    if(N==((1<<k)+(1<<(k-1)))){
        cout<<"NO\n";
        return 0;
    }
    if(N==((1<<(k+1))-1)){
        auto re=make(N);
        cout<<"YES\n";
        for(int i=0;i<N;i++){
            if(i) cout<<" ";
            cout<<re[i];
        }
        cout<<"\n";
        return 0;
    }
    
    auto ans=make((1<<k)-1),Z=make((1<<(k-1))-1);
    
    for(int x:Z){
        if(x+(1<<k)+(1<<(k-1))<=N) ans.push_back(x+(1<<k)+(1<<(k-1)));
        ans.push_back(x+(1<<k));
        //cout<<x<<endl;
    }
    
    ans.push_back(1<<k);
    
    ans.push_back((1<<k)+(1<<(k-1)));
    
    cout<<"YES\n";
    for(int i=0;i<N;i++){
        if(i) cout<<" ";
        cout<<ans[i];
    }
    cout<<"\n";
    
    //check(ans);
    
    return 0;
    
    /*
    vector<int> X={1};
    for(int n=2;n<=400000;n*=2){
        vector<int> Y=X;reverse(all(Y));
        for(int x:Y){
            X.push_back(x|n);
        }
        X.push_back(n);
        
        if(si(X)==N){
            cout<<"YES\n";
            for(int i=0;i<N;i++){
                if(i) cout<<" ";
                cout<<X[i];
            }
            cout<<"\n";
            return 0;
        }
    }
    
    cout<<"NO\n";
    
    for(int N=25;N<=25;N++){
        vector<int> P(N);iota(all(P),1);
        do{
            vector<vector<int>> S(N,vector<int>(4));
            for(int i=0;i<N;i++){
                for(int j=0;j<4;j++){
                    if(P[i]&(1<<j)) S[i][j]=1;
                }
            }
            UF uf;uf.init(N*4);
            for(int i=0;i<N;i++){
                for(int j=0;j<4;j++){
                    if(i+1<N){
                        if(S[i][j]&&S[i+1][j]) uf.unite(i*4+j,(i+1)*4+j);
                    }
                    if(j+1<4){
                        if(S[i][j]&&S[i][j+1]) uf.unite(i*4+j,i*4+(j+1));
                    }
                }
            }
            set<int> RO;
            for(int i=0;i<N;i++){
                for(int j=0;j<4;j++){
                    if(S[i][j]){
                        RO.insert(uf.root(i*4+j));
                    }
                }
            }
            if(si(RO)==1){
                for(int i=0;i<N;i++){
                    for(int j=3;j>=0;j--){
                        cout<<S[i][j];
                    }
                    cout<<endl;
                }
                cout<<endl;
            }
        }while(next_permutation(all(P)));
    }
     */
}