#include <bits/stdc++.h>
using namespace std;
const int prime = 999983;
const int INF = 0x7FFFFFFF;
const long long INFF = 0x7FFFFFFFFFFFFFFF;
const double pi = acos(-1.0);
const double inf = 1e18;
const double eps = 1e-6;
const long long mod = 1e9 + 7;
long long qpow(long long a, long long b) {
  long long s = 1;
  while (b > 0) {
    if (b & 1) s = s * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return s;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
int dr[2][4] = {1, -1, 0, 0, 0, 0, -1, 1};
const int maxn = 2e5 + 10;
int a[maxn];
int main(void) {
  int n;
  cin >> n;
  if (n & 1) {
    cout << "YES" << endl;
    a[1] = 1;
    for (int i = 2; i <= n; i += 2) {
      a[i] = a[i - 1] + 3;
      a[i + 1] = a[i] + 1;
    }
    a[n + 1] = 2;
    a[n + 2] = 3;
    for (int i = n + 3; i <= 2 * n; i += 2) {
      a[i] = a[i - 1] + 3;
      a[i + 1] = a[i] + 1;
    }
    a[2 * n] = 2 * n;
    for (int i = 1; i <= 2 * n; ++i) printf("%d ", a[i]);
  } else
    puts("NO");
  return 0;
}
