#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
//ifstream fin("date.in");
#define MAX 102

int a[MAX * MAX], b[MAX][MAX], n, i, j, dr;

int main()
{
    cin >> n;
    for(i = 1; i <= n * n ; i++)
    {
        cin >> a[i];
    }
    sort(a + 1, a + n * n + 1);
    for(i = n * n ; i > n * (n - 1) ; i--)
    {
        b[i - n * (n - 1)][i - n * (n - 1)] = a[i];
    }
    dr = 0;
    for(i = 1 ; i <= n ; i++)
    {
        for(j = 1 ; j <= n ; j++)
        {
            if(i != j)
            {
                b[i][j] = a[++dr];
            }
            cout << b[i][j] << " ";
        }cout << "\n";
    }
}