#include <bits/stdc++.h>
using namespace std;
priority_queue<int> a, b;
int main() {
  int n, a[200050];
  cin >> n;
  if (n & 1) {
    cout << "YES" << endl;
    for (int i = 0; i < 2 * n; i++) {
      if (!(i & 1)) {
        a[i] = i + 1;
        a[(i + n) % (2 * n)] = i + 2;
      }
    }
    for (int i = 0; i < 2 * n; i++) printf("%d ", a[i]);
  } else {
    cout << "NO" << endl;
  }
}
