#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
const long long Mod = 1e9 + 7;
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= Mod;
  assert(b >= 0);
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % Mod;
    a = a * a % Mod;
  }
  return res;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
int n, arr[maxn], tot;
long long sum, lnum, rnum;
int main() {
  scanf("%d", &n);
  if (n % 2 == 0) {
    printf("NO\n");
    return 0;
  }
  for (int l = 1; l <= n; l++) {
    int r = l + n;
    if (l % 2 == 1) {
      arr[l] = ++tot;
      arr[r] = ++tot;
    } else {
      arr[r] = ++tot;
      arr[l] = ++tot;
    }
  }
  puts("YES");
  for (int i = 1; i <= 2 * n; i++) printf("%d ", arr[i]);
  return 0;
}
