#include <iostream>
#include <fstream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <algorithm>
using namespace std;

#define REP(i,n) for(int i=0; i<n; ++i)
#define FOR(i,a,b) for(int i=a; i<=b; ++i)
#define FORR(i,a,b) for (int i=a; i>=b; --i)
#define ALL(c) (c).begin(), (c).end()

typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef pair<int,int> P;
typedef pair<ll,ll> PL;

int main(){
    int k;
    cin >> k;
    VI ans;
    int m = (1 << k) - 1;

    set<int> st;
    FOR(i,1,m) st.insert(i);

    ans.push_back(m);
    st.erase(m);
    REP(i,k){
        int x = (1 << (k-1-i));
        // cout<< x << endl;
        for (int y = x; y < m; y += x){
            if (st.count(y)){
                ans.push_back(y);
                st.erase(y);
            }
        }
    }

    for (int x : ans) printf("%d ", x);
    cout<< endl;

    return 0;
}