#include<iostream>
#include<vector>
#include<string>
#include<algorithm>	
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
//kaewasuretyuui
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<int,pii> pip;
typedef vector<pip>vip;
const double PI=acos(-1);
const double EPS=1e-7;
const int inf=1e8;
const ll INF=1ll<<60;
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
vi out;
int n,t,q,N;
void dfs(int a,int b){
	if(b+q<=N)out.pb(b+q);
	if(a){
		dfs(a-1,b-pow(2,a-1));
		dfs(a-1,b+pow(2,a-1));
	}
}
int main(){
	cin>>n;
	assert(2<=n&&n<=12);
	q=3*n+1;
	N=pow(2,n);
	if(n<=3){
		rep(i,pow(2,n)-1)cout<<i+1<<" ";
		cout<<pow(2,n)<<endl;
	}else{
		rep(i,3*n+1)out.pb(3*n+1-i);
		t=pow(2,n)-3*n-1;
		rep(i,13)if(t<=pow(2,i)){
			n=i;
			break;
		}
		n++;
		dfs(n-1,pow(2,n-1));
		int m=out.size();
		rep(i,out.size()-1)cout<<out[i]<<" ";cout<<out[m-1]<<endl;
	}
}