#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int n, out[N];
void generate() {
  out[0] = 1, out[n] = 2;
  for (int i = 1; i < n; ++i) {
    out[i] = 2 * (n - i + 1);
    out[i + n] = out[i] - 1;
    if (!(i & 1)) {
      swap(out[i], out[i + n]);
    }
  }
}
bool valid() {
  for (int i = 0; i < 2 * n; ++i) {
    int j = (i + n) % (2 * n);
    if (i & 1) {
      if (out[i] - out[j] != 1) {
        return false;
      }
    } else {
      if (out[j] - out[i] != 1) {
        return false;
      }
    }
  }
  return true;
}
int main() {
  cin >> n;
  generate();
  if (!valid()) {
    return printf("NO\n"), 0;
  }
  printf("YES\n");
  for (int i = 0; i < 2 * n; ++i) {
    printf("%d ", out[i]);
  }
  return 0;
}
