#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

struct UnionFind{
	int n;
	vector<int> par;

	explicit UnionFind(int v): n(v), par(v,-1) {}

	void merge(int a, int b){
		int x = find(a);
		int y = find(b);
		if (x == y) return;
		if (-par[x] < -par[y]) swap(x, y);
		par[x] += par[y];
		par[y] = x;
		return;
	}

	int find(int x){
		if (par[x] < 0) return x;
		return par[x] = find(par[x]);
	}
};

const int mx = 20;

bool assertion(vector<int> p){
	int n = p.size();
	UnionFind uf(mx * n);
	vector<vector<int>> a(n, vector<int>(mx, 0));
	rep(i,0,n){
		rep(j,0,mx){
			if(p[i] >> j & 1){
				a[i][j] = 1;
			}
			//cout << a[i][j];
		}
		//cout << '\n';
	}
	rep(i,0,n){
		rep(j,0,mx-1){
			if (a[i][j] == 1 && a[i][j+1] == 1){
				uf.merge(i * mx + j, i * mx + j + 1);
			}
		}
	}
	rep(i,0,n-1){
		rep(j,0,mx){
			if (a[i][j] == 1 && a[i+1][j] == 1){
				uf.merge(i * mx + j, i * mx + j + mx);
			}
		}
	}
	int memo = -1;
	rep(i,0,n){
		rep(j,0,mx){
			if (a[i][j] == 0) continue;
			if (memo == -1){
				memo = uf.find(i * mx + j);
			}
			if (memo != uf.find(i * mx + j)){
				return false;
			}
		}
	}
	return true;
};

void naive(int n){
	vector<int> p(n);
	iota(p.begin(), p.end(), 1);
	do{
		if(assertion(p)){
			cout << n << ' ' << "YES\n";
			rep(i,0,n){
				cout << p[i];
				if (i == n-1) cout << '\n';
				else cout << ' ';
			}
			return;
		}
	}while(next_permutation(p.begin(), p.end()));
	cout << n << ' ' << "NO\n";
	return;
}

bool seen[20];
vector<int> kekka[20];

vector<int> construct_inner(int k);
vector<int> construct(int k, int n);

vector<int> construct_inner(int k){
	if (k == 1){
		return {1};
	}	
	if (k == 2){
		return {1, 3, 2};
	}
	if (k == 3){
		return {1, 3, 2, 6, 4, 5, 7};
	}
	if (seen[k]) return kekka[k];
	vector<int> ret = construct(k, (1 << k) - 1);
	seen[k] = 1;
	kekka[k] = ret;
	return ret;
}

vector<int> construct(int k, int n){
	vector<int> now = construct_inner(k-1);
	vector<int> tar = construct_inner(k-2);
	if (k >= 5 && n == (1 << k) - 1){
		rep(i,0, 1){
			if ((1 << k-1) + (1 << k-2) + tar[i] <= n){
				now.push_back(tar[i] + (1 << k-1) + (1 << k-2));
			}
			if ((1 << k-1) + tar[i] <= n){
				now.push_back(tar[i] + (1 << k-1));
			}
		}
		if ((1 << k-1) + (1 << k-2) + 0 <= n){
			now.push_back((1 << k-1) + (1 << k-2));
		}
		if ((1 << k-1) <= n){
			now.push_back((1 << k-1));
		}
		rep(i,1,(1 << k-2) - 1){
			if ((1 << k-1) + tar[i] <= n){
				now.push_back(tar[i] + (1 << k-1));
			}
			if ((1 << k-1) + (1 << k-2) + tar[i] <= n){
				now.push_back(tar[i] + (1 << k-1) + (1 << k-2));
			}
		}
		return now;
	}else if ( k >= 5){
		rep(i,0,(1 << k-2) -1){
			if ((1 << k-1) + (1 << k-2) + tar[i] <= n){
				now.push_back(tar[i] + (1 << k-1) + (1 << k-2));
			}
			if ((1 << k-1) + tar[i] <= n){
				now.push_back(tar[i] + (1 << k-1));
			}
		}
		if ((1 << k-1) + (1 << k-2) + 0 <= n){
			now.push_back((1 << k-1) + (1 << k-2));
		}
		if ((1 << k-1) <= n){
			now.push_back((1 << k-1));
		}
		return now;
	}else{
		rep(i,0, (1 << k-2) - 1){
			if ((1 << k-1) + (1 << k-2) + tar[i] <= n && (1 << k-1) + (1 << k-2) + tar[i] != (1 << k) - 1){
				now.push_back(tar[i] + (1 << k-1) + (1 << k-2));
			}
			if ((1 << k-1) + tar[i] <= n){
				now.push_back(tar[i] + (1 << k-1));
			}
		}
		if ((1 << k-1) + (1 << k-2) <= n){
			now.push_back((1 << k-1) + (1 << k-2));
		}
		if ((1 << k-1) <= n){
			now.push_back((1 << k-1));
		}
		if ((1 << k) - 1 <= n){
			now.push_back((1 << k) - 1);
		}
		return now;
	}
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int n; cin >> n;

	int k = 0;
	while ((1 << k) <= n){
		k++;
	}
	if (n == 1){
		cout << "YES\n";
		cout << "1\n";
		return 0;
	}
	if (n == 2){
		cout << "NO\n";
		return 0;
	}
	if (n == 3){
		cout << "YES\n";
		cout << "2 3 1\n";
		return 0;
	}
	if (n == 7){
		cout << "YES\n";
		cout << "1 3 2 6 4 5 7\n";
		return 0;
	}
	if (n < (1 << k-2) + (1 << k-1) + 1){
		cout << "NO\n";
	}else{
		cout << "YES\n";
		vector<int> ans = construct(k, n);
		rep(i,0,n){
			cout << ans[i];
			if (i == n-1) cout << '\n';
			else cout << ' ';
		}
		//assert(assertion(ans));
	}
}