#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10, INF = 0x3f3f3f3f;
const long long mod = 1e9 + 7, LINF = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-10, Pi = 2 * acos(0);
const int M = 12000005;
int n, m, k;
int a[N];
void solve() {
  scanf("%d", &n);
  if (n % 2 == 0)
    printf("NO\n");
  else {
    a[1] = 1;
    for (int i = 2; i <= n; i++) {
      if (i % 2 == 0)
        a[i] = a[i - 1] + 3;
      else
        a[i] = a[i - 1] + 1;
    }
    a[2 * n] = 2 * n;
    for (int i = 2 * n - 1; i > n; i--) {
      if (i % 2)
        a[i] = a[i + 1] - 3;
      else
        a[i] = a[i + 1] - 1;
    }
    printf("YES\n");
    for (int i = 1; i <= 2 * n; i++) {
      printf("%d ", a[i]);
    }
    printf("\n");
  }
}
int main() {
  int T, ce = 1, flag = 1;
  solve();
  return 0;
}
