#include <iostream>

using namespace std;
/*
fstream f("dominatrix.in", ios::in);
fstream g("dominatrix.out", ios::out); */
int n, i, j, a[1000010], nr;

void quickSort(int li, int ls)
{
    int i = li, j = ls;
    int aux, mij = a[(i+j) / 2];
    while (i <= j)
    {
        while (a[i] > mij) i++;
        while (a[j] < mij) j--;
        if (i <=j)
        {
            aux = a[i];
            a[i] = a[j];
            a[j] = aux;
            i++; j--;
        }
    }
    if (li < j) quickSort(li, j);
    if (i < ls) quickSort(i, ls);
}

int main()
{
    cin >> n;
    for (i = 1; i <= (n * n); i++) cin >> a[i];
    quickSort(1, n * n);
    nr = n + 1;
    for (i = 1; i <=n; i++)
    {
        for (j = 1; j <= n; j++) if (i == j) cout << a[i] << " ";
                                        else cout << a[nr++] << " ";
        cout << '\n';
    }
    return 0;
}