#include <bits/stdc++.h>
using namespace std;
const long long int mod = 1e9 + 7;
void solving() {
  long long int n;
  cin >> n;
  if (n % 2 == 0)
    cout << "NO"
         << "\n";
  else {
    cout << "YES"
         << "\n";
    cout << 1 << " ";
    long long int x = 4;
    while (x <= (2 * n - 1)) {
      cout << x << " " << x + 1 << " ";
      x += 4;
    }
    x = 2;
    while (x <= (2 * n - 1)) {
      cout << x << " " << x + 1 << " ";
      x += 4;
    }
    cout << 2 * n << "\n";
  }
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  solving();
  return 0;
}
