#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
long int n, a[200007], sum, x, y;
bool ok;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> n;
  if (n % 2 == 0) {
    cout << "NO";
    return 0;
  }
  long long now = 1;
  for (long int i = 1; i <= n; i++) {
    if (i % 2 == 0) {
      a[i + n] = now;
      a[i] = now + 1;
    } else {
      a[i + n] = now + 1;
      a[i] = now;
    }
    now += 2;
  }
  cout << "YES\n";
  for (long int i = 1; i <= n * 2; i++) cout << a[i] << " ";
}
