#include "bits/stdc++.h"
#define REP(i,n,N) for(ll i=(n); i<(N); i++)
#define RREP(i,n,N) for(ll i=(N-1); i>=n; i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define ALL(v) (v).begin(),(v).end()
#define p(s) cout<<(s)<<endl
#define p2(a,b) cout<<(a)<<" "<<(b)<<endl
typedef long long ll;
using namespace std;
const ll inf=1e18;

vector<int> ans;
void f(int L, int R) {
    if (L == 1 && R == 2) {
        ans.push_back(1);
        ans.push_back(2);
        return;
    }

    if (L == R) {
        ans.push_back(L);
        return;
    }

    int md = (L + R) / 2;
    ans.push_back(md);
    f(L, md - 1);
    f(md + 1, R);
}

int main(){
    int K;
    cin>>K;
    int node=1;
    REP(i,0,K){
        node*=2;
    }
    f(1,node-2);
    cout<<node-1;
    REP(i,0,ans.size()){
        cout<<" "<<ans[i];
    }
    cout<<endl;
    return 0;
}