#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
const long long M = 200006;
const int mod = 1000000007;
void solve() {
  int n;
  cin >> n;
  if (n % 2 == 0) {
    cout << "NO";
    exit(0);
  } else {
    cout << "YES"
         << "\n";
    vector<int> ans(2 * n + 1);
    int i = 1;
    int j = 2 * n;
    for (int k = 1; k <= n; k++) {
      int l = k + n;
      if (k % 2) {
        ans[k] = i;
        i++;
        ans[l] = i;
        i++;
      } else {
        ans[k] = j;
        j--;
        ans[l] = j;
        j--;
      }
    }
    for (int i = 1; i <= 2 * n; i++) cout << ans[i] << " ";
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int T = 1;
  while (T--) {
    solve();
  }
  return 0;
}
