#include <bits/stdc++.h>

using namespace std;

vector<int> G[11111];
int memo[1111];
int cnt = 0;

void dfs(int now, int prev) {
    if (memo[now] == -1) {
        memo[now] = ++cnt;
    }
    for (int e : G[now]) {
        if (e != prev) {
            dfs(e, now);
        }
    }
}

void makePerfectBinaryTree(int k) {
    vector<int> v((1 << (k - 1)));
    v[0] = 1;
    for (int i = 1; i < v.size(); i++) {
        v[i] = v[i - 1] + 2;
    }
    while (v.size() > 1) {
        vector<int> nv;
        for (int i = 0; i < v.size(); i += 2) {
            const int buf = (v[i] + v[i + 1]) / 2;
            nv.emplace_back(buf);
            G[buf].emplace_back(v[i]);
            G[buf].emplace_back(v[i + 1]);
            G[v[i]].emplace_back(buf);
            G[v[i + 1]].emplace_back(buf);
        }
        swap(nv, v);
    }
}

int main() {
    int k;
    cin >> k;
    if (k == 2) {
        cout << "1  3 2" << endl;
        return 0;
    }
    makePerfectBinaryTree(k);
    memset(memo, -1, sizeof(memo));
    dfs(1 << (k - 1), -1);
    vector<int> res((1 << k) - 1);
    for (int i = 1; i <= (1 << k) - 1; i++) {
        res[memo[i] - 1] = i;
    }
    swap(res[1], res[res.size() - 1]);
    for (int i = 0; i < res.size(); i++) {
        printf("%d%c", res[i], (i + 1 == res.size() ? '\n' : ' '));
    }
    return 0;
}