#include <bits/stdc++.h>
using namespace std;
int ara[400005];
long long cum[400005];
int main() {
  int n;
  scanf("%d", &n);
  int beeg = 2 * n, smol = 1;
  for (int i = 1; i <= n; i++) {
    if (i % 2)
      ara[i] = smol, smol += 2;
    else
      ara[i] = beeg, beeg -= 2;
  }
  for (int i = n + 1; i <= n + n; i++) {
    if ((i - n) % 2)
      ara[i] = ara[i - n] + 1;
    else
      ara[i] = ara[i - n] - 1;
  }
  for (int i = 1; i <= 2 * n; i++) ara[i + 2 * n] = ara[i];
  for (int i = 1; i <= 4 * n; i++) cum[i] = cum[i - 1] + ara[i];
  vector<long long> vec;
  for (int i = 1; i <= 2 * n; i++) vec.push_back(cum[i + n - 1] - cum[i - 1]);
  sort(vec.begin(), vec.end());
  if (vec[0] < vec[vec.size() - 1] - 1) {
    printf("NO\n");
    return 0;
  }
  printf("YES\n");
  for (int i = 1; i <= 2 * n; i++) printf("%d ", ara[i]);
  return 0;
}
