#include <bits/stdc++.h>
using namespace std;
long long maxcost(long long *dp, long long *ar, long long n) {
  dp[0] = 0;
  for (int i = 1; i <= n; i++) {
    dp[i] = ar[i - 1];
  }
  long long ma = -1;
  for (int i = 2; i <= n; i++) {
    for (long long j = i; j >= 1; j--) {
      ma = max(ma, dp[j] + dp[i - j]);
    }
    dp[i] = ma;
  }
  return dp[n];
}
int main() {
  long long t, n, ar[100];
  t = 1;
  vector<int> v1, v2;
  while (t--) {
    cin >> n;
    if (n % 2 == 0) {
      cout << "NO";
      return 0;
    }
    cout << "YES\n";
    v1.push_back(1);
    int i = 1;
    while (i <= 2 * n) {
      v2.push_back(i + 1);
      if (i + 2 <= 2 * n) {
        v2.push_back(i + 2);
        v1.push_back(i + 3);
        v1.push_back(i + 4);
      }
      i += 4;
    }
    for (auto i : v1) cout << i << " ";
    for (auto i : v2) cout << i << " ";
  }
  return 0;
}
