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