#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
vector<int>ans[15];
int main(){
	ans[2].pb(3); ans[2].pb(1); ans[2].pb(2);
	for(int i=3;i<=12;i++){
		ans[i] = ans[i-1];
		reverse(ans[i].begin(),ans[i].end());
		ans[i].pb(1<<(i-1));
		reverse(ans[i].begin(),ans[i].end());
		for(int ii=0;ii<ans[i-1].size();ii++){
			ans[i].pb(ans[i-1][ii]+(1<<(i-1)));
		}
	}
	int k;cin>>k;
	for(int ii=0;ii<ans[k].size();ii++)cout<<ans[k][ii]<<endl;
}