#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
//ll mod = 1;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000007;
const int mod17 = 1000000007;
const ll INF = (ll)mod17 * mod17;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

using ld = double;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
vector<T> vmerge(vector<T>& a, vector<T>& b) {
	vector<T> res;
	int ida = 0, idb = 0;
	while (ida < a.size() || idb < b.size()) {
		if (idb == b.size()) {
			res.push_back(a[ida]); ida++;
		}
		else if (ida == a.size()) {
			res.push_back(b[idb]); idb++;
		}
		else {
			if (a[ida] < b[idb]) {
				res.push_back(a[ida]); ida++;
			}
			else {
				res.push_back(b[idb]); idb++;
			}
		}
	}
	return res;
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	//if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
//mod should be <2^31
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
bool operator<(modint a, modint b) { return a.n < b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
template<typename T>
void addv(vector<T>& v, int loc, T val) {
	if (loc >= v.size())v.resize(loc + 1, 0);
	v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
	fill(isp + 2, isp + mn, true);
	for (int i = 2; i < mn; i++) {
		if (!isp[i])continue;
		ps.push_back(i);
		for (int j = 2 * i; j < mn; j += i) {
			isp[j] = false;
		}
	}
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	if (res == st.begin())return st.end();
	res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
	return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
	a = a + b; return a;
}
mP operator-(mP a, mP b) {
	return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
	a = a - b; return a;
}
LP operator+(LP a, LP b) {
	return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
	a = a + b; return a;
}
LP operator-(LP a, LP b) {
	return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
	a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
//int dx[4] = { 1,0,-1,0 };
//int dy[4] = { 0,1,0,-1 };

int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
//------------------------------------

bool isok(vector<int> v) {
	int n = v.size();
	int sz = 0;
	int t = 1;
	while (t <= n) {
		sz++; t *= 2;
	}
	vector<vector<int>> b(n, vector<int>(sz));
	rep(i, n) {
		rep(j, sz) {
			if (v[i] & (1 << j))b[i][j] = 1;
		}
	}
	auto isok = [&](int i, int j) {
		if (0 <= i && i < n && 0 <= j && j < sz) {
			if (b[i][j])return true;
		}
		return false;
	};
	vector<vector<bool>> used(n, vector<bool>(sz));
	int num = 0;
	rep(i, n)rep(j, sz) {
		if (used[i][j])continue;
		if (!b[i][j])continue;
		queue<P> que;
		que.push({ i,j });
		num++;
		while (!que.empty()) {
			P p = que.front(); que.pop();
			rep(d, 4) {
				int ni = p.first + dx[d];
				int nj = p.second + dy[d];
				if (isok(ni, nj) && !used[ni][nj]) {
					used[ni][nj] = true;
					que.push({ ni,nj });
				}
			}
		}
	}
	return num == 1;
}

vector<int> mkspe(int len) {
	vector<int> res = { 4,6,2,3,1,5,7 };
	rep(_, len - 3) {
		int ad = res.back() + 1;
		int sz = res.size();
		rep(i, sz)res.push_back(res[i] + ad);
		res.pop_back();
		res.push_back(ad);
		res.push_back(2 * ad - 1);
	}
	return res;
}
vector<int> mk(int n) {
	if (n <= 7) {
		vector<int> v(n);
		rep(i, n)v[i] = i + 1;
		do {
			if (isok(v))return v;
		} while (next_permutation(all(v)));
		return {};
	}
	else if (n <= 15) {
		if (n <= 12)return {};
		if (n == 13) {
			vector<int> res = mkspe(3);
			res.push_back(13);
			res.push_back(9);
			res.push_back(11);
			res.push_back(10);
			res.push_back(12);
			res.push_back(8);
			return res;
		}
		if (n == 15) {
			return mkspe(4);
		}
		if (n == 14) {
			auto res = mkspe(4); res.pop_back();
			return res;
		}
	}
	else {
		int sz = 0;
		int t = 1;
		while (t <= n) {
			sz++; t *= 2;
		}
		int bb = 1;
		while (2 * bb <= n)bb *= 2;
		assert(t / 2 == bb);
		if (bb + bb / 2 >= n)return {};
		vector<int> res;
		res.push_back(bb);
		res.push_back(bb + bb / 2);
		vector<int> pre = mkspe(sz - 2);
		rep(i, pre.size()) {
			res.push_back(pre[i] + bb);
			if (pre[i] + bb + bb / 2 <= n && pre[i] != 1) {
				res.push_back(pre[i] + bb + bb / 2);
			}
		}
		res.push_back(bb + bb / 2 + 1);
		vector<int> ad = mkspe(sz - 1);
		reverse(all(ad));
		for (int val : ad)res.push_back(val);
		return res;
	}
}
void solve() {
	int n; cin >> n;
	auto ans = mk(n);
	if (ans.empty()) {
		cout << "NO\n";
	}
	else {
		cout << "YES\n";
		//coutarray(ans);
		assert(ans.size() == n);
		//assert(isok(ans));
		coutarray(ans);
	}
}



signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed<<setprecision(10);
	//init_f();
	//init();
	//while(true)
	//expr();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}