#include<fstream>
#include<iostream>
#include<algorithm>
using namespace std;
int N,i,j,k;
int v[10100],a[105][105];

bool compar(int a,int b)
{
    return a>b;
}

int main()
{
    cin>>N;
    int patrat=N*N;
    for (i=1;i<=patrat;++i)
        cin>>v[i];
    sort(v+1,v+patrat+1,compar);
    /*for (i=1;i<=patrat;++i)
        cout<<v[i]<<' ';
    cout<<'\n';*/
    for (i=1;i<=N;++i)
        a[i][i]=v[i];
    for (j=1;j<=N;++j)
    {
        for (k=1;k<=N;++k)
            if (j!=k)
                a[j][k]=v[i++];
    }
    for (j=1;j<=N;++j)
    {
        for (k=1;k<=N;++k)
            cout<<a[j][k]<<' ';
        cout<<'\n';
    }
    return 0;
}