#include <bits/stdc++.h>
using namespace std;
const int inf = (int)(2e9);
const long long INF = (long long)(5e18);
const int N = 300010;
long long n, a[N], s, x, y, num;
int main() {
  scanf("%lld", &n);
  s = (2 * n + 1) * 2 * n / 2;
  s *= n;
  num = s / (2 * n);
  y = s - num * 2 * n;
  x = 2 * n - y;
  if (x != y) {
    puts("NO");
    return 0;
  }
  a[1] = 1;
  int now1 = 2 * n, now0 = 1;
  for (int i = 1; i <= n; i++) {
    if (i % 2 == 1) {
      a[i] = now0;
      a[i + n] = now0 + 1;
      now0 += 2;
    } else {
      a[i] = now1;
      a[i + n] = now1 - 1;
      now1 -= 2;
    }
  }
  puts("YES");
  for (int i = 1; i <= n + n; i++) printf("%lld ", a[i]);
  return 0;
}
