#include <bits/stdc++.h>
using namespace std;
int a[400009];
int main() {
  memset(a, -1, sizeof(a));
  int n, ans = 0, ii, now, bo = 0, f = 1;
  scanf("%d", &n);
  if (n % 2 == 0) {
    printf("NO\n");
    return 0;
  }
  f = 1;
  a[1] = 1;
  ii = 1 + n;
  now = 2;
  while (now <= n * 2) {
    a[ii] = now;
    ii++;
    now++;
    if (now >= n * 2) break;
    if (ii > n * 2) ii -= n * 2;
    a[ii] = now;
    now++;
    if (f == 1)
      ii -= n;
    else
      ii += n;
    f = 1 - f;
  }
  printf("YES\n");
  for (int i = 1; i <= n * 2; i++) printf("%d ", a[i]);
  return 0;
}
