#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 5;
int res[MAXN];
int main() {
  int n, t = 0;
  scanf("%d", &n);
  if (n % 2 == 0) return 0 * puts("NO");
  puts("YES");
  for (int i = 1; i <= n; i++) {
    if (t == 0) {
      res[i] = i * 2 - 1;
      res[n + i] = i * 2;
    } else {
      res[i] = i * 2;
      res[n + i] = i * 2 - 1;
    }
    t ^= 1;
  }
  for (int i = 1; i <= n * 2; i++) printf("%d ", res[i]);
  return 0;
}
