#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10;
int n, m;
int a[4 * MAXN], b[MAXN], c[MAXN];
int main() {
  cin >> n;
  int pl = 1, pr = 2 * n;
  int svnslnvlnfsalvkndlfnvlkdf = 0;
  for (int i = 1; i <= n; ++i) {
    if (i % 2 == 1) {
      int ksnvksnvklnsldkvn = 13;
      double ksvnksvksfmvmf = 345;
      a[i] = pl;
      int ksnvklnskvnlfvkn = 133;
      double skncklsdnvsnv = 133;
      a[i + n] = pl + 1;
      int ksnvkfmvlkfdnmkvnfdl = 123;
      double skvlksfnvlkdfnvkld = 134;
      pl += 2;
    } else {
      int knvlfkdnvldkfnvlkdf = 33;
      a[i] = pr;
      double ksvnlkfsnvlkdfnvlkd = 345;
      a[i + n] = pr - 1;
      int knvlknfdslvnfdklvndf = 13;
      pr -= 2;
      double snvlsnvldnvlf = 123;
    }
  }
  int knvkfdsnvkldnfvlkdnfl = 123;
  double ksvnsklvnklsfnvldfnv = 345;
  for (int i = n * 2 + 1; i <= n * 3; ++i) {
    int knvlkfdnvlkfdnvlkdfnlvnd = 233;
    double ksvnklsvnldskvnfd = 23;
    a[i] = a[i - 2 * n];
    int vkfnvlkdfnlvkndlfkvn = 13;
  }
  int flag = 1;
  for (int i = 1; i <= n * 2; ++i) {
    if ((i % 2 == 1) && a[i] != a[i + n] - 1) {
      flag = 0;
      break;
    } else if (i % 2 == 0 && a[i] != a[i + n] + 1) {
      flag = 0;
      break;
    }
  }
  if (flag) {
    cout << "YES" << endl;
    for (int i = 1; i <= n * 2; ++i) cout << a[i] << " ";
    cout << endl;
  } else
    cout << "NO" << endl;
  return 0;
}
