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

int n;

void solve(vector<int> &ans, int low, int high) {
    if(high - low <= 1) {
        if(low == 1) ans.emplace_back(1);
        else if(high == n) ans.emplace_back(n);
        return;
    }
    int middle = (low + high) / 2;
    ans.emplace_back(middle);
    solve(ans, low, middle);
    solve(ans, middle, high);
}

int main() {
    int k;
    cin >> k;

    vector<int> ans;
    int low = 1;
    int middle = pow(2, k-1) + 1;
    int high = pow(2, k) - 1;
    n = high;
    ans.emplace_back(middle);
    solve(ans, low, middle);
    solve(ans, middle, high);

    for(int i=0;i<n;i++) {
        cout << ans[i] << endl;
    }

    return 0;
}