#include <algorithm>
#include <vector>
#include <iostream>
using namespace std;
int n,x,lo,hi;
vector <int> v;
int main()
{
    cin >> n;
    for (int i = 1; i <= n*n; i++){
        cin >> x;
        v.push_back(x);
    }
    lo = 0; hi = n*n-1;

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

    for (int i = 1; i <= n; i++){
        for (int j = 1; j <= n; j++)
            if (i == j) cout <<v[hi--]<<" ";
            else cout <<v[lo++]<<" ";
        cout<<"\n";

    }

    return 0;
}