#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
using ll = long long;

int main(void){
  int n; cin >> n;
  if(n%2==0){
    cout << "No" << endl; return 0;
  }
  cout << "Yes" << endl;
  vector<int> p(n), q(n);
  int last, st=(n+3)/2;
  for(int i=0; i<n/2+1; i++) p[i]=2*i+1, last=i;
  p[last+1]=2;
  for(int i=last+2; i<n; i++) p[i]=p[i-1]+2;
  for(int i=0; i<n; i++){
    q[i]=st+i-p[i];
  }
  for(auto pp:p) cout << pp << ' '; cout << endl;
  for(auto pp:q) cout << pp << ' '; cout << endl;
  return 0;
}