// #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;
using ll = long long int;
using int64 = long long int;
 
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
 
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const int INF = 1LL << 29;
const ll LONGINF = 1LL << 60;
const ll MOD = 1000000007LL;
 
bool check(int N, const vector<int>& ans) {
    if (ans.size() != N) {
        return false;
    }
    set<int> nums;
    for(int i=0; i<N; i++) {
        nums.emplace(ans[i] + ans[(i+1)%N]);
    }
    return nums.size() == N;
}
int main() {
    int N; cin >> N;
    if(N == 2) {
        cout << "No" << endl;
    } else {
        cout << "Yes" << endl;
        vector<int> ans;
        if (N % 2 == 0) {
            ans.emplace_back(2);
        } else {
            ans.emplace_back(1);
        }
        for(int i=N; i>=1; i--) {
            if (i == ans.front()) continue;
            ans.emplace_back(i);
        }

        check(N, ans);
        for(int i=0; i<N; i++) {
            cout << ans[i] << " \n"[i+1==N];
        }
    }
    return 0;
}