#include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for(ll i=0; i<(ll)(n); i++)

int lob(const auto& v, auto x) { return lower_bound(ALL(v),x)-v.begin(); }
bool chmax(auto& a, auto b) { return a<b ? a=b, true : false; }
bool chmin(auto& a, auto b) { return a>b ? a=b, true : false; }
using ll=long long; const int INF=1e9+10; const ll INFL=4e18;
using VI=vector<int>; using VVI=vector<VI>; using VL=vector<ll>; using VVL=vector<VL>;
using PL=pair<ll,ll>; using VP=vector<PL>; using WG=vector<vector<pair<int,ll>>>;

#ifdef LOCAL
#include "./debug.hpp"
#else
#define debug(...)
#define print_line
#endif


//----------------------------------------------------------

void solve() {
    ll N; cin>>N;

    if(N%2==0) {
        cout<<"No"<<endl;
        return;
    }

    ll a=(N+3)/2;
    VL P,Q;
    ll x=1;
    REP(i,N) {
        if(x>N) x=2;
        P.push_back(x);
        Q.push_back(a-x);
        a++; x+=2;
    }

    cout<<"Yes"<<endl;
    REP(i,N) cout<<P[i]<<' '; cout<<endl;
    REP(i,N) cout<<Q[i]<<' '; cout<<endl;
}

int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    //cout<<fixed<<setprecision(15);
    int T=1; //cin>>T;
    while(T--) solve();
}