#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)

using namespace std;

int main() {
    int n;
    cin >> n;
    
    if (n%2 == 0) {
        puts("No");
        return 0;
    }
    
    int m = (n-1)/2;
    vector<tuple<int, int, int>> ds;
    rep(i, n) {
        int j = (i+m)%n;
        ds.emplace_back(i+j+2, i+1, j+1);
    }
    sort(ds.begin(), ds.end());
    
    puts("Yes");
    
    rep(i, n) cout << get<1>(ds[i]) << " \n"[i == n-1];
    rep(i, n) cout << get<2>(ds[i]) << " \n"[i == n-1];
    
    return 0;
}