#include <stdio.h>
#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000005
#define Inf64 1000000000000000001LL

int main(){
	
	int n;
	cin>>n;
	if(n%2==0){
		cout<<"No"<<endl;
	}
	else{
		cout<<"Yes"<<endl;
		vector<int> p(n),q(n);
		int c = 0;
		rep(i,n){
			p[i] = c;
			c += 2;
			c %= n;
		}
		rep(i,n){
			int ans = n-1;
			ans += i-(n/2);
			ans -= p[i];
			q[i] = ans;
		}
		rep(i,n){
			if(i!=0)cout<<' ';
			cout<<p[i]+1;
		}
		cout<<endl;
		rep(i,n){
			if(i!=0)cout<<' ';
			cout<<q[i]+1;
		}
		cout<<endl;
	}
	/*
	vector<int> p(n);
	rep(i,n)p[i] = i;
	do{

	set<int> s;
rep(i,n)s.insert(p[i]-i);
if(s.size()==n){
	rep(i,n)cout<<p[i]+1<<" ";
	cout<<endl;
	return 0;
	}
}
	while(next_permutation(p.begin(),p.end()));
	*/
}