#include <bits/stdc++.h>
using namespace std;
const long long MAX = 1e16;
const long long MM = 1e18;
const long long mod = 998244353;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, 1, 0, -1};
long long gcd(long long p, long long q) {
  while (q != 0) {
    long long r = p % q;
    p = q;
    q = r;
  }
  return p;
}
long long expo(long long x, long long n, long long M = mod) {
  long long ans = 1;
  while (n > 0) {
    if (n & 1) {
      ans = (ans * x) % M;
    }
    x = (x * x) % M;
    n >>= 1;
  }
  return ans;
}
const long long MaxSize = 3e5;
long long facts[MaxSize], invFacts[MaxSize];
void preproc() {
  facts[0] = 1;
  for (int i = 1; i < MaxSize; i++) {
    facts[i] = ((long long)facts[i - 1] * i) % mod;
  }
  invFacts[MaxSize - 1] = expo(facts[MaxSize - 1], mod - 2, mod);
  for (int i = MaxSize - 2; i >= 0; i--) {
    invFacts[i] = ((long long)invFacts[i + 1] * (i + 1)) % mod;
  }
}
long long combination(long long n, long long k) {
  if (n < k) return 0;
  long long res = facts[n];
  res = ((long long)res * invFacts[k]) % mod;
  return ((long long)res * invFacts[n - k]) % mod;
}
void solve() {
  int n;
  cin >> n;
  if (n & 1) {
    cout << "YES" << '\n';
    for (int i = 0; i < n; i++) {
      cout << i * 2 + 1 + (i & 1) << " ";
    }
    for (int i = 0; i < n; i++) {
      cout << i * 2 + 2 - (i & 1) << " ";
    }
    cout << '\n';
    return;
  } else {
    cout << "NO" << '\n';
    return;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int m;
  int t = 1;
  while (t--) {
    solve();
  }
}
