#include <bits/stdc++.h>
using namespace std;
const long long losn = 1e6 + 5;
const long long maxn = 1e5 + 5;
const long long minn = 1e3 + 5;
const long long tiny = 1e2 + 5;
const long long inf = 1e9;
const long long mod = 1e9 + 7;
const long long hmod = 4698571;
long long arr[maxn * 2];
int main() {
  long long n;
  cin >> n;
  long long a = 1, b = 2;
  for (long long i = 1; i <= n; i++) {
    arr[i] = a;
    arr[i + n] = b;
    a += 2;
    b += 2;
    swap(a, b);
  }
  long long sums = 0;
  for (long long i = 1; i <= n; i++) {
    sums += arr[i];
  }
  long long mins = sums;
  long long maxs = sums;
  long long l = 1, r = n;
  while (1) {
    r++;
    if (r == n * 2 + 1) r = 1;
    sums += arr[r];
    sums -= arr[l];
    l++;
    if (l == (n * 2 + 1)) l = 1;
    if (l == 1 && r == n) break;
    mins = min(mins, sums);
    maxs = max(maxs, sums);
  }
  if (maxs - mins != 1) {
    cout << "NO" << endl;
  } else {
    cout << "YES" << endl;
    for (long long i = 1; i <= n * 2; i++) {
      cout << arr[i] << " ";
    }
  }
  return 0;
}
