#include <iostream>
#include <vector>
#include <utility>
#include <algorithm>
#include <string>
#include <stack>
using ll = long long;
#define MOD 1000000007
using namespace std;

int K, p;

int pow(int k,int n) {
    int s=1;
    for(int i=0;i<n;i++) {
        s*=k;
    }
    return s;
}

void printTree(int height, int rootsize) {
    if (height == 0) {
        if (rootsize == 1) {
            cout << rootsize + 1 << " ";
            cout << 1 << " ";
        }
        else if (p - 1 == rootsize){
            return;
        }
        else {
             cout << rootsize + 1 << " ";
        }
    }
    else {
        cout << rootsize + 1 << " ";
        printTree(height - 1, rootsize - pow(2, height - 1));
        printTree(height - 1, rootsize + pow(2, height - 1));
    }
}

int main(){
    cin >> K;
    p = pow(2, K);
    printTree(K-1, pow(2, K - 1));
    return 0;
}