#include <bits/stdc++.h>

using namespace std;

#define int long long

int rev(int x, int k) {
    vector<int> bit;
    for (int i = 0; i < k; ++i)
        bit.push_back(bool((1 << i) & x));
    reverse(bit.begin(), bit.end());
    int y = 0;
    for (int i = 0; i < k; ++i)
        if (bit[i])
            y += (1 << i);
    return y;
}

signed main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int n;
    cin >> n;
    int k = __lg(n);
    if (n <= (1 << k) + (1 << (k - 1))) {
        cout << "NO";
        return 0;
    }
    cout << "YES\n";
    if (n == 1) {
        cout << "1";
        return 0;
    }
    if (n == 3) {
        cout << "2 3 1";
        return 0;
    }
    if (n == 7) {
        cout << "7 5 1 3 2 6 4";
        return 0;
    }
    vector<vector<int>> solve(k + 2);
    solve[2] = {1, 3, 2};
    solve[3] = {7, 5, 1, 3, 2, 6, 4};
    for (int i = 4; i <= k + 1; ++i) {
        solve[i].push_back((1 << i) - 1);
        for (int j: solve[i - 2]) {
            solve[i].push_back(rev(j, i - 2) + (1 << (i - 1)));
            if (rev(j, i - 2) != 1 && rev(j, i - 2) + (1 << (i - 1)) + (1 << (i - 2)) != (1 << i) - 1)
                solve[i].push_back(rev(j, i - 2) + (1 << (i - 1)) + (1 << (i - 2)));
        }
        solve[i].push_back((1 << (i - 1)) + (1 << (i - 2)) + 1);
        for (int j: solve[i - 1])
            solve[i].push_back(j);
        solve[i].push_back((1 << (i - 1)) + (1 << (i - 2)));
        solve[i].push_back((1 << (i - 1)));
    }
    for (int i: solve[k + 1])
        if (i <= n)
            cout << i << ' ';
}