/*
Things to notice:
1. do not calculate useless values
2. do not use similar names
 
Things to check:
1. submit the correct file
2. time (it is log^2 or log)
3. memory
4. prove your naive thoughts 
5. long long
6. corner case like n=0,1,inf or n=m
7. check if there is a mistake in the ds or other tools you use
8. fileio in some oi-contest

9. module on time 
10. the number of a same divisor in a math problem
11. multi-information and queries for dp and ds problems
*/
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
const int mod=998244353;
const int inf=0x3f3f3f3f;
void print(int x)
{
	for(int i=9;i>=0;i--) 
	{
		if(x&(1<<i)) cout<<"1";
		else cout<<"0";
	}
	cout<<"\n";
}
void solve()
{
	int n;
	cin>>n;
	if(n==1)
	{
		cout<<"YES\n1\n";
		return;
	}
	if(n==3)
	{
		cout<<"YES\n1 3 2\n";
		return;
	 } 
	int lg=0;
	while((1<<lg)<n) lg++;
	if((1<<lg)==n)
	{
		cout<<"NO\n";
		return;
	} 
	lg--;
	if(n<=(1<<lg)+(1<<(lg-1)))
	{
		cout<<"NO\n";
		return;
	}
	vector <int> vec;
	vec.pb(0);
	for(int i=0;i<lg;i++)
	{
		for(int j=vec.size()-1;j>=0;j--) vec.pb(vec[j]+(1<<i));
	}
	int pat=(1<<lg)+(1<<(lg-1));
	vector <int> ans;
	for(int i=1;i<vec.size();i++) if(vec[i]!=(1<<(lg-1)))
	{
		ans.pb(vec[i]);
		if(vec[i]+(1<<lg)>pat&&vec[i]+(1<<lg)<=n) ans.pb(vec[i]+(1<<lg));
	}
	for(int i=1;i<(1<<(lg-1));i++) ans.pb(vec[i]+(1<<lg));
	ans.pb(1<<lg),ans.pb(pat),ans.pb(1<<(lg-1));
	cout<<"YES\n";
	for(int i=0;i<ans.size();i++) cout<<ans[i]<<" ";
	cout<<"\n";
//	for(int i=0;i<ans.size();i++) print(ans[i]);
}
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int _=1;
//	cin>>_;
	while(_--) solve();
	return 0;
}