#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
const int N = 2000086, MOD = 998244353, INF = 0x3f3f3f3f;
int n, m, w[N];



int main() {
    cin >> n;
    iota(w + 1, w + n + 1, 1);
    if (n > 2)
        for (int i = 2; i <= n; i++)
            if (w[i] + w[i - 1] == w[1] + w[n]) {
                if (i == n) {
                    puts("No");
                    return 0;
                }
                swap(w[i], w[i + 1]);
            }
    puts("Yes");
    for (int i = 1; i < n + 1; i++) printf("%d ", w[i]);
    return 0;
}