#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 200005;
int p[MAX_N];
int A[MAX_N];
int main() {
  int n;
  cin >> n;
  if (n % 2) {
    cout << "YES" << endl;
    p[1] = 0;
    for (int i = 2; i <= n * 2; i++) {
      if (i % 2)
        p[i] = (p[i - 2] + 2) % (n * 2);
      else
        p[i] = (p[i - 1] + n) % (n * 2);
    }
    for (int i = 1; i <= n * 2; i++) {
      A[p[i] + 1] = i;
    }
    for (int i = 1; i <= n * 2; i++) {
      cout << A[i] << " \n"[i == n * 2];
    }
  } else
    cout << "NO" << endl;
  return 0;
}
