#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 7;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
int a[200005];
int main() {
  int n;
  scanf("%d", &n);
  if (n % 2 == 0)
    printf("NO\n");
  else {
    int f = 1;
    for (int i = 1; i <= n; i++) {
      if (f == 1) {
        a[i] = 2 * i - 1;
        a[i + n] = 2 * i;
        f = -1;
      } else {
        a[i] = 2 * i;
        a[i + n] = 2 * i - 1;
        f = 1;
      }
    }
    printf("YES\n");
    for (int i = 1; i <= 2 * n; i++) {
      if (i != 1) printf(" ");
      printf("%d", a[i]);
    }
    printf("\n");
  }
  return 0;
}
