#include <iostream>
#include <vector>
#include <cassert>
using namespace std;

int main() {
    int n; cin >> n;
    if (n%2 == 0) {
        cout << "No" << "\n";
        return 0;
    }
    cout << "Yes" << "\n";
    vector<int> p(n), q(n);
    for (int i = 0; i < n/2; i++) p[i] = n/2 - i, q[i] = 2*(i+1);
    for (int i = n/2; i < n; i++) p[i] = n + n/2 - i, q[i] = 2*(i-n/2) + 1;
    for (int i = 0; i < n-1; i++) assert(p[i+1]+q[i+1]-p[i]-q[i] == 1);
    for (int i = 0; i < n; i++) cout << p[i] << " \n"[i==n-1];
    for (int i = 0; i < n; i++) cout << q[i] << " \n"[i==n-1];
}