#include <iostream>
#include <algorithm>

using namespace std;

int n, whip[10005], range, poz;

int main()
{
    cin >> n;
    range=n*n;
    for(int i=1; i<=range; i++)
        cin >> whip[i];
    sort(whip+1, whip+range+1, greater<int>());
    poz=n+1;
    for(int i=1; i<=n; i++){
        for(int j=1; j<=n; j++)
            if(i==j)
                cout << whip[i] << " ";
            else{
                cout << whip[poz] << " ";
                poz++;
            }
        cout << "\n";
    }
    return 0;
}