#include <bits/stdc++.h>
const long long MOD = 1000 * 1000 * 1000 + 7;
const long long MOD1 = 998244353;
using namespace std;
long long power(unsigned long long x, unsigned long long y) {
  unsigned long long res = 1;
  while (y > 0) {
    if (y & 1) res = (unsigned long long)(res * x);
    y = y >> 1;
    if (x <= 100000000) x = (unsigned long long)(x * x);
  }
  return res;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n;
  cin >> n;
  if (n % 2 == 0)
    cout << "NO" << '\n';
  else {
    cout << "YES" << '\n';
    long long a[2 * n];
    long long s = 1;
    for (int i = 0; i < 2 * n; i += 2) {
      a[i] = s;
      s += 2;
    }
    s = 2;
    long long po = n;
    long long cont = 1;
    while (cont <= n) {
      a[po] = s;
      cont += 1;
      s += 2;
      po = (po + 2) % (2 * n);
    }
    for (int(i) = (0); (i) < (2 * n); ++(i)) cout << a[i] << ' ';
  }
  return 0;
}
