#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 7;
int a[maxn];
int main() {
  int n;
  scanf("%d", &n);
  if (n % 2 == 0) {
    printf("NO\n");
    return 0;
  }
  printf("YES\n");
  for (int i = 1; i <= n; i++) a[i] = 2 * i - 1;
  for (int i = 1; i <= n; i++) a[i + n] = 2 * i;
  for (int i = 2; i <= n; i += 2) swap(a[i], a[i + n]);
  for (int i = 1; i <= 2 * n; i++) printf("%d%c", a[i], " \n"[i == 2 * n]);
}
