#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <stack>
#include <queue>
#include <math.h>
#include <cmath>
#include <map>
#include <numeric>
#include <string.h>
#include <fstream>

typedef long long ll;
typedef long double ld;

#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define mp(a, b) make_pair(a, b)
#define vi vector<int>
#define ios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0)

using namespace std;
int a[50], b[50];
int n, k;

void body1(vi arr)
{
	F0R(j, 4)
		FORd(i, 1, k + 1)
	{
		int r = ceil(sqrt(8 * i)) / 2, num = i - r*(r - 1) / 2;
		/*if (arr[i] == 2 && r < n)
		{
			arr[i + r] = 1;
			arr[i + r + 1] = 1;
		}
		else if (arr[i] == 4 && r < n - 1)
		{
			arr[i + r] = 2;
			arr[i + r + 1] = 2;
		}
		else if (arr[i] == 8 && r < n - 2)
		{
			arr[i + r] = 4;
			arr[i + r + 1] = 4;
		}*/
		if (arr[i] == 0)
		{
			if (r == n)//последний ряд
			{
				if (num == 1)
				{
					if (arr[i + 1] != 0 && arr[i - r + 1] != 0)
						arr[i] = arr[i - r + 1] - arr[i + 1];
				}
				else if (num < r)
				{
					if (arr[i - 1] != 0 && arr[i - r] != 0)
						arr[i] = arr[i - r] - arr[i - 1];
					else if (arr[i + 1] != 0 && arr[i - r + 1] != 0)
						arr[i] = arr[i - r + 1] - arr[i + 1];
				}
				else
				{
					if (arr[i - 1] != 0 && arr[i - r] != 0)
						arr[i] = arr[i - r] - arr[i - 1];
				}
			}

			else if (r > 1)//все ряды кроме верхнего
			{
				if (arr[i + r] != 0 && arr[i + r + 1] != 0)
					arr[i] = arr[i + r] + arr[i + r + 1];
				if (num < r)
					if (arr[i + 1] != 0 && arr[i - r + 1] != 0)
						arr[i] = arr[i - r + 1] - arr[i + 1];
				if (num > 1)
				{
					if (arr[i - 1] != 0 && arr[i - r] != 0)
						arr[i] = arr[i - r] - arr[i - 1];
				}
			}
			else
				if (arr[i + 1] != 0 && arr[i + 2] != 0)
					arr[i] = arr[i + 1] + arr[i + 2];
		}
	}
}

void rec(int w, vi vec)
{
	int p = 1;
	vi arr = vec;
	for (int e = k; e > k - n; --e)
	{
		if (arr[e] == 0)
		{
			arr[e] = w;
			body1(arr);
			FORd(i, 1, k + 1)
			{
				int r = ceil(sqrt(8 * i)) / 2, num = i - r*(r - 1) / 2;
				/*if (a[i] == 2 && r < n)
				{
					a[i + r] = 1;
					a[i + r + 1] = 1;
				}
				else if (a[i] == 4 && r < n - 1)
				{
					a[i + r] = 2;
					a[i + r + 1] = 2;
				}
				else if (a[i] == 8 && r < n - 2)
				{
					a[i + r] = 4;
					a[i + r + 1] = 4;
				}*/
				if (r == n)//последний ряд
				{
					if (num == 1)
					{
						if (arr[i] != arr[i - r + 1] - arr[i + 1])
							return;
					}
					else if (num < r)
					{
						if (arr[i] != arr[i - r] - arr[i - 1] || arr[i] != arr[i - r + 1] - arr[i + 1])
							return;
					}
					else
					{
						if (arr[i] != arr[i - r] - arr[i - 1])
							return;
					}
				}

				else if (r > 1)//все ряды кроме верхнего
				{
					if (arr[i] != arr[i + r] + arr[i + r + 1])
						return;
					if (num < r)
						if (arr[i] != arr[i - r + 1] - arr[i + 1])
							return;
					if (num > 1)
					{
						if (arr[i] != arr[i - r] - arr[i - 1])
							return;
					}
				}
				else
					if (arr[i] != arr[i + 1] + arr[i + 2])
						return;

			}
			rec(p, arr);
			p++;
		}
	}
}

int body(int cur)
{
	F0R(j, k)
	{
		int c = cur;
		FORd(i, 1, k + 1)
		{
			int r = ceil(sqrt(8 * i)) / 2, num = i - r*(r - 1) / 2;
			if (a[i] == 2 && r < n)
			{
				a[i + r] = 1;
				a[i + r + 1] = 1;
				c--;
			}
			else if (a[i] == 4 && r < n - 1)
			{
				a[i + r] = 2;
				a[i + r + 1] = 2;
				c--;
			}
			else if (a[i] == 8 && r < n - 2)
			{
				a[i + r] = 4;
				a[i + r + 1] = 4;
				c--;
			}
			if (!b[i])
			{
				if (r == n)//последний ряд
				{
					if (num == 1)
					{
						if (b[i + 1] != 0 && b[i - r + 1] != 0)
						{
							b[i] = 1;
							a[i] = a[i - r + 1] - a[i + 1];
							c--;
						}
					}
					else if (num < r)
					{
						if (b[i - 1] != 0 && b[i - r] != 0)
						{
							a[i] = a[i - r] - a[i - 1];
							b[i] = 1;
							c--;
						}
						else if (b[i + 1] != 0 && b[i - r + 1] != 0)
						{
							b[i] = 1;
							a[i] = a[i - r + 1] - a[i + 1];
							c--;
						}
					}
					else
					{
						if (b[i - 1] != 0 && b[i - r] != 0)
						{
							b[i] = 1;
							a[i] = a[i - r] - a[i - 1];
							c--;
						}
					}
				}

				else if (r > 1)//все ряды кроме верхнего
				{
					if (b[i + r] != 0 && b[i + r + 1] != 0)
					{
						b[i] = 1;
						a[i] = a[i + r] + a[i + r + 1];
						c--;
					}
					if (num < r)
					{
						if (b[i + 1] != 0 && b[i - r + 1] != 0)
						{
							b[i] = 1;
							a[i] = a[i - r + 1] - a[i + 1];
							c--;
						}
					}
					if (num > 1)
					{
						if (b[i - 1] != 0 && b[i - r] != 0)
						{
							b[i] = 1;
							a[i] = max(a[i], a[i - r] - a[i - 1]);
							c--;
						}
					}
				}
				//последний ряд
				else if (b[i + 1] != 0 && b[i + 2] != 0)
				{
					b[i] = 1;
					a[i] = a[i + 1] + a[i + 2];
					c--;
				}
			}
		}
		if (c == cur)
			break;
		cur = c;
	}
	return cur;
}


int main()
{
	ios;
	cin >> n;
	k = n * (n + 1) / 2;
	int cur = 0;
	vi vec(k + 1);
	FOR(i, 1, k + 1)
	{
		cin >> a[i];
		if (a[i])
			b[i] = 1;
		else
			cur++;
		vec[i] = a[i];
	}
	int f = body(cur);
	if (f > 0)
	{
		rec(1, vec);
	}
	int p = 1;
	FOR(i, 1, k + 1)
	{
		int r = ceil(sqrt(8 * i)) / 2;
		if (r > p)
		{
			p++;
			cout << '\n';
		}
		cout << a[i] << " ";
	}

	getchar();
	getchar();
	return 0;
}