#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

queue<int> que;

void dfs2(int l, int r){
    if(r - l <= 0){
        return;
    }
    if(r - l == 1){
        que.emplace(l);
        return;
    }

    int m = (l + r) / 2;
    que.emplace(m);
    dfs2(l, m);
    dfs2(m + 1, r);
}

void dfs(int l, int r){
    if(r - l <= 0){
        return;
    }
    if(r - l == 3){
        que.emplace(l);
        que.emplace(l + 1);
        que.emplace(l + 2);
        return;
    }
    
    int m = (l + r) / 2;
    que.emplace(m);
    dfs2(l, m);
    dfs(m + 1, r);
}

int main(){
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    int K;
    std::cin >> K;

    dfs(1, (1 << K));

    while(!que.empty()){
        int x = que.front();
        que.pop();

        std::cout << x << " \n"[que.empty()];
    }
}