#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  vector<int> a(2 * n);
  bool b = true;
  for (int i = 1, j = 0; i < 2 * n + 1; i++) {
    a[j] = i;
    if (i & 1)
      if (b)
        j += n;
      else
        j -= n;
    else {
      if (!b)
        j++;
      else
        j--;
    }
    b = !b;
    j %= 2 * n;
  }
  set<int> s;
  int dsum = 0;
  for (int i = 0; i < n; i++) dsum += a[i];
  int ss = dsum;
  for (int i = n; i < 2 * n; i++) {
    dsum += a[i] - a[i - n];
    s.insert(dsum);
    if (s.size() > 2) {
      cout << "NO\n";
      goto exit;
    }
  }
  dsum = ss;
  for (int i = 1; i < n; i++) {
    dsum = dsum - a[n - i] + a[2 * n - i];
    s.insert(dsum);
    if (s.size() > 2) {
      cout << "NO\n";
      goto exit;
    }
  }
  cout << "YES\n";
  for (int i = 0; i < 2 * n; i++) cout << a[i] << ' ';
  cout << endl;
exit:
  for (int i = 0; i < 2 * n; i++) cerr << a[i] << ' ';
  cerr << endl;
  for (auto i = s.begin(); i != s.end(); i++) cerr << *i << ' ';
  cerr << endl;
  return 0;
}
