#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>

#include <sstream>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>

#include <string>
#include <cstring>
#include <vector>
#include <tuple>
#include <bitset>

#include <queue>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>

#include <fstream>
#include <random>
//#include <time.h>
#include <ctime>
#pragma endregion //#include
/////////
#define REP(i, x, n) for(int i = x; i < n; ++i)
#define rep(i,n) REP(i,0,n)
#define ALL(X) X.begin(), X.end()
/////////
#pragma region typedef
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef std::pair<LL,LL> PLL;//
typedef std::pair<int,int> PII;//
#pragma endregion //typedef
////定数
const int INF = (int)1e9;
const LL MOD = (LL)1e9+7;
const LL LINF = (LL)1e18+20;
const LD PI = acos(-1.0);
const double EPS = 1e-9;
/////////
using namespace::std;

//完全二分木の入れ方を出力
void f(int N){
	queue< pair<int,int> > que;
	que.push( pair<int,int>(1,N) );
	while( !que.empty() ){
		pair<int,int> now = que.front();
		que.pop();
		int mid = (now.first+now.second)/2;
		cout << mid << " ";
		if( now.first <= mid-1 ){
			que.push( pair<int,int>(now.first,mid-1) );
		}
		if( mid+1 <= now.second){
			que.push( pair<int,int>(mid+1,now.second) );
		}
	}
}
void solve(){
	int K;
	cin >> K;

	int num = (1<<K)-1;
	int N = num-K;
	f(N);
	for(int i=N+1;i<=num;++i){
		if( i != N+1 ){
			cout << ' ';
		}
		cout << i;
	}
	cout << endl;
}

#pragma region main
signed main(void){
	std::cin.tie(0);
	std::ios::sync_with_stdio(false);
	std::cout << std::fixed;//小数を10進数表示
	cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別	

	solve();
}
#pragma endregion //main()