#include <bits/stdc++.h>
const long long int MOD = 1e9 + 7;
using namespace std;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int n;
  cin >> n;
  int arr[2 * n], prev = 0, val = 1;
  for (int i = 0; i < n; i++) {
    arr[prev] = val;
    val++;
    prev = (prev + n) % (2 * n);
    arr[prev] = val;
    val++;
    prev = (prev + 1) % (2 * n);
  }
  long long int mini = 10000000000000, maxi = -10000000000000, sum = 0;
  for (int i = 0; i < n; i++) sum += arr[i];
  mini = min(sum, mini);
  maxi = max(sum, maxi);
  for (int i = 1; i < 2 * n; i++) {
    sum = sum - arr[i];
    sum = sum + arr[(i + n) % (2 * n)];
    mini = min(sum, mini);
    maxi = max(sum, maxi);
  }
  if (maxi - mini <= 1) {
    cout << "YES" << endl;
    for (int i = 0; i < 2 * n; i++) cout << arr[i] << " ";
  } else
    cout << "NO" << endl;
  return 0;
}
