#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(x) (x).begin(), (x).end()
using ll = long long;
const ll MOD = 998244353;
#include<atcoder/all>
using namespace atcoder;
using mint = modint998244353;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll n;cin>>n;
  if(n%2==0){
    cout<<"No"<<endl;
    return 0;
  }
  cout<<"Yes"<<endl;
  vector<ll> P(n,-1),Q(n,-1);
  P[0]=1,P[1]=n/2+2;
  for(ll i=2;i<n;i+=2){
    P[i]=P[i-2]+1;
  }
  for(ll i=3;i<n;i+=2){
    P[i]=P[i-2]+1;
  }
  rep(i,n){
    Q[i]=(n+3)/2+i-P[i];
  }
  rep(i,n){
    cout<<P[i]<<" ";
  }cout<<endl;
  rep(i,n){
    cout<<Q[i]<<" ";
  }cout<<endl;
}