#include <bits/stdc++.h>
using namespace std;
int a[200100];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    if (i % 2)
      a[i] = i;
    else
      a[i] = 2 * n + 2 - i;
  }
  for (int i = n + 1; i <= 2 * n; i++) {
    if ((i - n) % 2)
      a[i] = a[i - n] + 1;
    else
      a[i] = a[i - n] - 1;
  }
  long long Max, Min, ans = 0;
  for (int i = 1; i <= n; i++) ans += a[i];
  Min = ans;
  Max = ans;
  for (int i = 1; i < 2 * n; i++) {
    ans = ans - a[i] + a[(i + n - 1) % (2 * n) + 1];
    Min = min(ans, Min);
    Max = max(ans, Max);
  }
  if (Max - Min < 2) {
    printf("YES\n");
    for (int i = 1; i < 2 * n; i++) printf("%d ", a[i]);
    printf("%d\n", a[2 * n]);
  } else
    printf("NO\n");
}
