#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, i, j, k = 2, c = 0, d = 0;
  cin >> n;
  int a[2 * n];
  long long int sum = 0;
  a[0] = 1;
  vector<long long int> v;
  for (i = 1, j = n; k <= 2 * n;) {
    if (d % 4 < 2) {
      a[j] = k;
      j++;
      k++;
      d++;
    } else {
      a[i] = k;
      i++;
      k++;
      d++;
    }
  }
  for (int i = 0; i < n; i++) sum = sum + a[i];
  v.push_back(sum);
  c++;
  for (int i = 0; i < n; i++) {
    sum = sum - a[i] + a[n + i];
    v.push_back(sum);
    c++;
  }
  for (int i = 0; i < n; i++) {
    sum = sum - a[n + i] + a[i];
    v.push_back(sum);
    c++;
  }
  sort(v.begin(), v.end());
  if (v[c - 1] - v[0] > 1)
    cout << "NO" << endl;
  else {
    cout << "YES" << endl;
    for (int i = 0; i < 2 * n; i++) cout << a[i] << " ";
  }
  return 0;
}
