#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using namespace std;
int n;
void solve() {
  cin >> n;
  if (n % 2 == 0) {
    cout << "NO";
    return;
  }
  cout << "YES\n";
  vector<int> v(2 * n + 1);
  for (int i = 1; i <= n; i++) {
    if (i % 2) {
      v[i] = 2 * i - 1;
      v[i + n] = 2 * i;
    } else {
      v[i] = 2 * i;
      v[i + n] = 2 * i - 1;
    }
  }
  for (int i = 1; i <= 2 * n; i++) cout << v[i] << " ";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t = 1;
  while (t--) {
    solve();
  }
}
