#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int n, nsqr;
vector <int> v;

int main()
{
    cin >> n;
    nsqr = n * n;
    int x;
    for(int i = 0; i < nsqr; i++)
    {
        cin >> x;
        v.push_back(x);
    }

    sort(v.begin(), v.end());

    int dom = 0;
    int rest = 0;

    for(int i = 0; i < n; i++)
    {
        for(int j = 0; j < n; j++)
        {
            if(i == j)
            {
                cout << v[nsqr - dom - 1] << " ";
                dom ++;
            }
            else
            {
                cout << v[rest] << " ";
                rest++;
            }
        }
        cout << "\n";
    }
    return 0;
}