#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <vector>
#include <string>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>

#define int long long
#define MOD7 1000000007
#define MOD9 1000000009

#define rep(i, n) for (int i = 0; i < (n); i++)
#define itrep(i, a) for (auto i = (a).begin(); i != (a).end(); i++)
#define REP(i, a, n) for (int i = (a); i <= (n); i++)
#define all(a) (a).begin(), (a).end()

using namespace std;

int dx[4] = { 1, 0, -1, 0 };
int dy[4] = { 0, -1, 0, 1 };

template<class T> void inputVector(vector<T>& v, int n) {
    v.resize(n);
    for (int i = 0; i < v.size(); i++) cin >> v[i];
}

void dfs(vector<int> &ret, int minV, int maxV) {
	if (minV > maxV) return;
	int val = (minV + maxV) / 2;
	ret.push_back(val);
	dfs(ret, minV, val - 1);
	dfs(ret, val + 1, maxV);
}

signed main() {
	int K;
	cin >> K;

	int N = pow(2, K) + 0.0000001 - 1;

	vector<int> ret;
	int first = min(N, 3 * K);
	for (int i = first; i >= 1; i--) ret.push_back(i);

	dfs(ret, first + 1, N);

	rep(i, N) {
		cout << ret[i] << ' ';
	}
	cout << endl;

    return 0;
}