#include<iostream>
#include<vector>
#include<algorithm>
#include<cassert>
using namespace std;
int tm;
int vis[2<<17][20];
const int dir[5]={0,1,0,-1};
bool check(vector<int>ans)
{
	int N=ans.size();
	int pcsum=0;
	{//perm
		vector<bool>vis(N+1);
		for(int v:ans)
		{
			if(v<=0||v>N)return false;
			if(vis[v])return false;
			vis[v]=true;
			pcsum+=__builtin_popcount(v);
		}
	}
	tm++;
	int sx=0,sy=0;
	while(!(ans[sx]>>sy&1))sy++;
	vis[sx][sy]=tm;
	vector<pair<int,int> >Q;
	Q.push_back(make_pair(sx,sy));
	for(int i=0;i<Q.size();i++)
	{
		int x=Q[i].first,y=Q[i].second;
		for(int r=0;r<4;r++)
		{
			int tx=x+dir[r],ty=y+dir[r+1];
			if(tx<0||ty<0||tx>=N||vis[tx][ty]==tm)continue;
			if(!(ans[tx]>>ty&1))continue;
			vis[tx][ty]=tm;
			Q.push_back(make_pair(tx,ty));
		}
	}
	return Q.size()==pcsum;
}
vector<int>gray(int N)
{//[0,N=2^k)
	int k=0;
	while(N>>k+1)k++;
	assert((1<<k)==N);
	vector<int>ans(N);
	for(int i=0;i<N;i++)ans[i]=i^i>>1;
	return ans;
}
vector<int>solve(int N)
{
	int k=0;
	while(N>>k+1)k++;
	if((1<<k+1)==N+1)
	{
		vector<int>ret=gray(N+1);
		assert(ret[0]==0);
		ret.erase(ret.begin());
		return ret;
	}
	if(k<2||!(N>>k-1&1)||!(N>>k-2&1))return vector<int>();
	vector<int>ans=gray(1<<k);
	assert(ans[0]==0);
	ans.erase(ans.begin());
	assert(ans.back()==(1<<k-1));
	{
		vector<int>t=gray(1<<k-2);
		reverse(t.begin(),t.end());
		assert(t.back()==0);
		t.pop_back();
		ans.push_back(1<<k|1<<k-1);
		for(int v:t)ans.push_back(1<<k|1<<k-1|v);
		assert(ans.back()==(1<<k|1<<k-1|1<<0));
	}
	const int base=1<<k|1<<k-1|1<<k-2;
	//ans.push_back(base);
	{
		vector<int>t=gray(1<<k-1);
		assert(t[0]==0);
		t.erase(t.begin());
		for(int v:t)
		{
			v|=1<<k;
			ans.push_back(v);
			v|=1<<k-1;
			if(v<=N&&(v&base)==base&&v>base)ans.push_back(v);
		}
	}
	ans.push_back(base);
	ans.push_back(1<<k);
	return ans;
}
vector<int>solve2(int N)
{
	vector<int>t=solve(N);
	if(!t.empty())return t;
	if(t.empty())
	{
		t=solve(N+1);
		if(!t.empty()&&t[t.size()-2]==N+1)
		{
			t.erase(t.begin()+t.size()-2);
			if(check(t))return t;
		}
	}
	return vector<int>();
}
vector<int>solve3(int N)
{
	int k=0;
	while(N>>k+1)k++;
	if((1<<k+1)==N+1)
	{
		vector<int>ret=gray(N+1);
		assert(ret[0]==0);
		ret.erase(ret.begin());
		return ret;
	}
	if(k<2)return vector<int>();
	const int base=1<<k|1<<k-1;
	if(N<=base)return vector<int>();
	vector<int>G=gray(1<<k-1);
	vector<int>ans;
	ans.reserve(N);
	{//00
		for(int i=1;i<G.size();i++)ans.push_back(G[i]);
	}
	{//01
		ans.push_back(1<<k-1|G[G.size()-1]);
		ans.push_back(1<<k-1);
		for(int i=G.size()-2;i>=1;i--)ans.push_back(1<<k-1|G[i]);
	}
	ans.push_back(base+1);
	{//10
		for(int i=1;i<=G.size();i++)
		{
			int v=G[i%G.size()];
			v|=1<<k;
			ans.push_back(v);
			v|=1<<k-1;
			if(v<=N&&v!=base+1)ans.push_back(v);
		}
	}
	return ans;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	for(int N=1;N<=200000;N++)
	{
		/*
		vector<int>t1=solve(N),t2=solve2(N),t3=solve3(N);
		if(!t1.empty())assert(check(t1));
		if(!t2.empty())assert(check(t2));
		if(!t3.empty())assert(check(t3));
		if((t1.empty()&&t2.empty())!=t3.empty())
		{
			assert(!t3.empty());
			for(int k=20;k--;)cout<<(N>>k&1);
			cout<<endl;
		}
		*/
		/*
		vector<int>t=solve(N);
		if(t.empty())
		{
			t=solve(N+1);
			if(!t.empty()&&t[t.size()-2]==N+1)
			{
				cout<<"try on "<<N<<" = ";
				for(int k=20;k--;)cout<<(N>>k&1);
				cout<<endl;
				t.erase(t.begin()+t.size()-2);
				for(int v:t)
				{
					for(int k=20;k--;)cout<<(v>>k&1);
					cout<<endl;
				}
				if(check(t))cout<<"FN ans"<<endl;
			}
		}
		else if(0&&!check(t))
		{
			cout<<"WA on "<<N<<endl;
			for(int v:t)
			{
				for(int k=20;k--;)cout<<(v>>k&1);
				cout<<endl;
			}
			return 1;
		}
		*/
	}
	int N;cin>>N;
	vector<int>t=solve3(N);
	if(t.empty())cout<<"NO\n";
	else
	{
		assert(check(t));
		cout<<"YES\n";
		for(int i=0;i<t.size();i++)cout<<t[i]<<(i+1==t.size()?"\n":" ");
	}
}