#include <bits/stdc++.h>
using namespace std;
long long unsigned int countDivisors(long long unsigned int n) {
  long long unsigned int cnt = 0;
  for (long long unsigned int i = 1; i <= sqrt(n); i++) {
    if (n % i == 0) {
      if (n / i == i)
        ++cnt;
      else
        cnt += 2;
    }
  }
  return cnt;
}
vector<int> v;
void Search(string pat, string txt) {
  int n = txt.size();
  int m = pat.size();
  for (int i = 0; i <= n - m; i++) {
    int j;
    for (j = 0; j < m; j++) {
      if (txt[i + j] != pat[j]) break;
    }
    if (j == m) {
      v.push_back(i);
    }
  }
  return;
}
int findFirst(const std::vector<int> &array, int key, int low, int high) {
  int ans = -1;
  while (low <= high) {
    int mid = low + (high - low) / 2;
    if (key == array[mid]) {
      ans = mid;
      high = mid - 1;
    } else if (key > array[mid])
      low = mid + 1;
    else
      high = mid - 1;
  }
  return ans;
}
int findLast(const std::vector<int> &array, int key, int low, int high) {
  int ans = -1;
  while (low <= high) {
    int mid = low + (high - low) / 2;
    if (key == array[mid]) {
      ans = mid;
      low = mid + 1;
    } else if (key > array[mid])
      low = mid + 1;
    else
      high = mid - 1;
  }
  return ans;
}
int d, x, y;
void extendedEuclid(int a, int b) {
  if (b == 0) {
    d = 1;
    x = 1;
    y = 0;
  } else {
    extendedEuclid(b, a % b);
    int temp = x;
    x = y;
    y = temp - (a / b) * y;
  }
}
int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  int n;
  cin >> n;
  if (n % 2 == 0) {
    cout << "NO" << endl;
    return 0;
  }
  cout << "YES" << endl;
  vector<int> v(2 * n, 0);
  int cnt = 0, i = 1;
  for (int cnt = 0; cnt < 2 * n; cnt++) {
    v[cnt] = i++;
    if (cnt % 2 == 0) {
      if (cnt + n < 2 * n) {
        cnt += n;
        v[cnt] = i++;
      } else {
        cnt -= n;
        v[cnt] = i++;
      }
    } else {
      cnt++;
      v[cnt] = i++;
    }
  }
  for (int i = 0; i < (int)v.size(); i++) cout << v[i] << " ";
  cout << endl;
  ;
  return 0;
}
