#include <algorithm>
#include <iostream>
#include <vector>

void search(unsigned node, int& id, int layer, int n, int* node_id, auto& map);

int main() {
	using namespace std;
	int n;
	cin >> n;
	auto arr = new int[1 << n];
	for(int i = 0; i < (1 << n) - 1; i++)
		cin >> arr[i]; 
	auto map = new int[1 << n];
	int id = -1;
	search(1, id, 0, n, arr, map);
	id = 0;
	for(int i = 0; i < n; i++)
	{
		for(int j = 0; j < (1 << i); j++)
			cout << map[id++] << ' ';
		cout << endl;
	}
	delete[] map;
	delete[] arr;
	return 0;
}

void search(unsigned node, int& id, int layer, int n, int* node_id, auto& map) {
	if(layer == n - 1)
	{
		++id;
		map[node - 1] = node_id[id];
		return;
	}
	search(node << 1, id, layer + 1, n, node_id, map);
	++id;
	map[node - 1] = node_id[id]; 
	search(node << 1 | 1, id, layer + 1, n, node_id, map);
}