#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

struct DSU {
    static const int N = 2e5 * 20 + 10;
    int Parent[N], Rank[N], Size[N], cnt;
    void init(int n) {
        for (int i = 1; i <= n; i++) {
            Parent[i] = i, Rank[i] = 0, Size[i] = 1;
        }
        cnt = n;
    }
    int find(int v) {
        if (Parent[v] == v) return v;
        else return Parent[v] = find(Parent[v]);
    }
    void unite(int u, int v) {
        u = find(u), v = find(v);
        if (u == v) return;
        if (Rank[u] < Rank[v]) swap(u, v);
        if (Rank[v] == Rank[u]) Rank[u]++;
        Parent[v] = u, cnt--;
        Size[u] += Size[v];
    }
} dsu;

bool getbit(int mask, int bit) {
    return mask & (1 << bit);
}

bool check(int n, int b, const vector<int>& a) {
    int tot = 0;
    for (int i = 0; i < n; i++) {
        tot += __builtin_popcount(a[i]);
    }
    dsu.init(n * b);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j + 1 < b; j++) {
            if (getbit(a[i], j) && getbit(a[i], j + 1)) {
                dsu.unite(i * b + j + 1, i * b + j + 2);
            }
        }
    }
    for (int i = 0; i + 1 < n; i++) {
        for (int j = 0; j < b; j++) {
            if (getbit(a[i], j) && getbit(a[i + 1], j)) {
                dsu.unite(i * b + j + 1, (i + 1) * b + j + 1);
            }
        }
    }
    return n * b - tot + 1 == dsu.cnt;
}

void foo() {
    const int n = 9;
    const int b = 6;
    vector<int> a(n);
    iota(a.begin(), a.end(), 1);
    bool ok = false;
    do {
        if (check(n, b, a)) {
            cout << "YES\n";
            for (int x : a) {
                cout << x << "\t" << bitset<b>(x) << "\n";
            }
            ok = true;
            break;
        }
    } while (next_permutation(a.begin(), a.end()));
    if (!ok) {
        cout << "NO\n";
    }
    exit(0);
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
#endif

    // foo();

    int n;
    cin >> n;
    vector<int> ans = {1, 3, 2, 6, 4, 5, 7};
    while (ans.size() < n) {
        vector<int> tmp = ans;
        reverse(tmp.begin(), tmp.end());
        for (int& x : ans) {
            x <<= 1;
        }
        for (int x : tmp) {
            ans.push_back((x << 1) | 1);
        }
        ans.push_back(1);
    }
    vector<int> tmp;
    for (int x : ans) {
        if (x <= n) {
            // cout << "+ " << x << "\n";
            tmp.push_back(x);
        } else {
            // cout << "- " << x << "\n";
        }
    }
    swap(ans, tmp);
    if (check(n, 20, ans)) {
        cout << "YES\n";
        for (int x : ans) {
            cout << x << " ";
        }
        cout << "\n";
    } else {
        cout << "NO\n";
    }

#ifdef LOCAL
    cout << "\nTime elapsed: " << double(clock()) / CLOCKS_PER_SEC << " s.\n";
#endif
}