#include <bits/stdc++.h>
using namespace std;

#define rep(i, N) for (int i = 0; i < (N); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back

using ll = long long;

int gray(int x) {
    return x ^ (x >> 1);
}

int bitrev(int x, int k) {
    int y = 0;
    rep(i, k) {
        if (x >> i & 1) {
            y |= 1 << (k - 1 - i);
        }
    }
    return y;
}

vector<int> solve(int n) {
    if (n == 1) {
        return {1};
    }
    if (n == 3) {
        return {2, 3, 1};
    }
    rep(k, 20) {
        if (3 * (1 << k) + 1 <= n && n < 4 * (1 << k)) {
            vector<int> v;
            for (int x = 1; x <= 2 * (1 << k) - 2; x++) {
                v.pb(gray(x));
            }
            v.pb(3 * (1 << k) + 1);
            for (int x = (1 << k) - 1; x >= 0; x--) {
                v.pb(2 * (1 << k) + bitrev(gray(x), k));
                int y = 3 * (1 << k) + bitrev(gray(x), k);
                if (y <= n) {
                    if (y <= n && y != 3 * (1 << k) && y != 3 * (1 << k) + 1) {
                        v.pb(y);
                    }
                }
            }
            v.pb(3 * (1 << k));
            v.pb(1 << k);
            return v;
        }
    }
    return {};
}

int main() {
    int n;
    cin >> n;
    auto v = solve(n);
    if (v.empty()) {
        cout << "NO" << endl;
    } else {
        cout << "YES" << endl;
        rep(i, n) {
            cout << v[i] << (i + 1 < n ? ' ' : '\n');
        }
    }
}