#include <bits/stdc++.h>
using namespace std;
template <typename T>
class CumulativeSum {
  const int n;
  std::vector<T> sum_data;

 public:
  CumulativeSum(vector<T> data) : n(data.size()) {
    sum_data.resize(n + 1);
    for (int i = 0; i < n; i++) {
      sum_data[i + 1] = sum_data[i] + data[i];
    }
  }
  T sum(int l, int r) const {
    assert(0 <= l && l <= r && r <= n);
    return sum_data[r] - sum_data[l];
  }
};
int main() {
  int n;
  cin >> n;
  vector<long long> s(2 * n, -1);
  for (int i = 0; i < n; i++) {
    int a = i;
    int b = i + n;
    if (i % 2 == 1) {
      swap(a, b);
    }
    s[a] = 2 * i + 1;
    s[b] = 2 * i + 2;
  }
  for (int i = 0; i < n; i++) s.push_back(s[i]);
  CumulativeSum<long long> c(s);
  long long mx = -1e18;
  long long mi = 1e18;
  for (int i = 0; i < 2 * n; i++) {
    mx = max(c.sum(i, i + n), mx);
    mi = min(c.sum(i, i + n), mi);
  }
  if (mx - mi < 2) {
    cout << "YES" << endl;
    for (int i = 0; i < 2 * n; i++) {
      cout << s[i] << " ";
    }
    cout << endl;
  } else {
    cout << "NO" << endl;
  }
}
