#include <iostream>
#include <algorithm>
using namespace std;
int n, v[10100], sol[110][110];

int main()
{
	int i, j, k;
	cin >> n;
	for(i = 1; i <= n * n; ++i)
		cin >> v[i];
	sort(v + 1, v + n * n + 1);
	for(i = 1, j = n * n; i <= j; ++i, --j)
		swap(v[i], v[j]);
	for(i = 1; i <= n; ++i)
		sol[i][i] = v[i];
	k = n + 1;
	for(i = 1; i <= n; ++i)
	{
		for(j = 1; j <= n; ++j)
		{
			if(i == j)
				continue;
			sol[i][j] = v[k];
			k++;
		}
	}
	for(i = 1; i <= n; ++i)
	{
		for(j = 1; j <= n; ++j)
			cout << sol[i][j] << ' ';
		cout << "\n";
	}
	return 0;
}