#include <bits/stdc++.h>
using namespace std;
int a[200010];
int n;
int pos(int x) {
  if (x > 0 && x <= 2 * n) return x;
  if (x <= 0) return x + n + n;
  return x - n - n;
}
int main() {
  cin >> n;
  if (!(n & 1)) {
    puts("NO");
    return 0;
  }
  puts("YES");
  a[1] = 1, a[n + 1] = 2;
  for (int i = 1; i * 2 < n; i++) {
    if (i & 1) {
      a[pos(n + i + 1)] = i * 4 - 1;
      a[pos(i + 1)] = i * 4;
      a[pos(n - i + 1)] = i * 4 + 1;
      a[pos(n + n + 1 - i)] = i * 4 + 2;
    } else {
      a[pos(n + i + 1)] = i * 4;
      a[pos(i + 1)] = i * 4 - 1;
      a[pos(n - i + 1)] = i * 4 + 2;
      a[pos(n + n + 1 - i)] = i * 4 + 1;
    }
  }
  for (int i = 1; i <= (n << 1); i++) {
    cout << a[i] << " ";
  }
  return 0;
}
