#include <bits/stdc++.h>
using namespace std;
int v[200005];
int main() {
  int n;
  scanf("%d", &n);
  v[1] = 1;
  int i = 2;
  bool flag = 0, ok = 0;
  int index1 = 2, index2 = n + 1;
  !(n % 2) ? (printf("NO\n"), ok = 1) : (printf("YES\n"));
  int dick = INT_MAX;
  if (ok) return 0;
  while (i <= 2 * n) {
    if (!flag) {
      v[index2++] = (i++);
      v[index2++] = (i++);
    } else {
      v[index1++] = (i++);
      v[index1++] = (i++);
    }
    flag ^= 1;
  }
  for (int i = 1; i <= 2 * n; ++i) printf("%d ", v[i]);
  return 0;
}
