#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int K;
	cin >> K;
	
	vector<int> ans;
	queue<pii> que;
	que.emplace(0, INF);
	while (ans.size() < (1 << K) - 2) {
		auto [l, r] = que.front(); que.pop();
		int m = (l + r) >> 1;
		ans.emplace_back(m);
		que.emplace(l, m);
		que.emplace(m, r);
	}
	
	auto compress = [](auto &&v, auto &&cv) -> void {
		for (auto &&u : v) cv.emplace_back(u);
		std::sort(std::begin(cv), std::end(cv));
		cv.erase(std::unique(std::begin(cv), std::end(cv)), std::end(cv));
		for (auto &&u : v) u = std::lower_bound(std::begin(cv), std::end(cv), u) - std::begin(cv) + 1;
	};
	vector<int> cx;
	compress(ans, cx);
	ans.emplace_back(0);
	REP(i, ans.size()) printf("%d%c", ans[i] + 1, " \n"[i + 1 == ans.size()]);
}