#include<iostream>
#include<fstream>
#include<vector>
#include<algorithm>
using namespace std;
int l,l1,x,n;
vector <int>v;
int main()
{
    ifstream f("dominatrix.in");
    ofstream g("dominatrix.out");
    f>>n;
    for(int i=1;i<=n*n;i++)
    {

        f>>x;
        v.push_back(x);

    }
    sort(v.begin(),v.end());
    l=n*n-1;l1=0;
    for(int i=0;i<=n-1;i++)
        {for(int j=0;j<=n-1;j++)
        if(i==j)
          g<<v[l--]<<" ";
else g<<v[l1++]<<" ";
 g<<"\n";}


    return 0;
}