#include <bits/stdc++.h>

#include <atcoder/fenwicktree.hpp>
#include <atcoder/segtree.hpp>
#include <atcoder/modint.hpp>
#include <atcoder/dsu.hpp>
#include <atcoder/lazysegtree.hpp>

using namespace atcoder;
using namespace std;
using ll = long long;
using ull = unsigned long long;
template <class T>
using max_heap = priority_queue<T>;
template <class T>
using min_heap = priority_queue<T, vector<T>, greater<>>;
ll ll_min = numeric_limits<ll>::min();
ll ll_max = numeric_limits<ll>::max();
ll ALPHABET_N = 26;
using mint = modint998244353;
#define rep(i, n) for (ll i = (ll)0; i < (ll)n; i++)
#define rep_(i, k, n) for (ll i = (ll)k; i < (ll)n; i++)
#define all(a) a.begin(), a.end()

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	ll n;
	cin >> n;
	if (n == 2)
	{
		cout << "No" << endl;
		return 0;
	}
	vector<ll> ans(n);
	ll cur = 1;
	ll f_idx = 0, b_idx = n - 1;
	rep(i, n)
	{
		if (i % 2 == 0)
		{
			ans[f_idx] = cur;
			f_idx++;
		}
		else
		{
			ans[b_idx] = cur;
			b_idx--;
		}
		cur++;
	}
	cout << "Yes" << endl;
	rep(i, n) cout << ans[i] << (i == n - 1 ? '\n' : ' ');
	return 0;
}