#include<bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 1100;
int a[1100];
vector<int> vec[15];
void dfs(int l,int r,int t)
{
	if(l == r)
	{
		vec[t].push_back(a[l]);
		return;
	}
	int mid = (l + r) >> 1;
	vec[t].push_back(a[mid]);
	dfs(l,mid - 1,t + 1);
	dfs(mid + 1,r,t + 1);
	return;
}
signed main()
{
	int k;
	cin >> k;
	int n = pow(2,k) - 1;
	for(int i = 1;i <= pow(2,k) - 1;i++) cin >> a[i];
	dfs(1,n,1);
	for(int i = 1;i <= 10;i++) 
	{
		if(vec[i].size())
		{
			for(int j : vec[i]) cout << j << " ";
			cout << '\n';
		}
	}
	return 0;
}