#include<iostream>
#include<algorithm>
using namespace std;
int n,p,A[100005],D[105][105];
int main()
{
    int i,j;
    cin>>n;
    for (i=1;i<=n*n;++i)
        cin>>A[i];
    sort(A+1,A+n*n+1);
    p=n*n;
    for (i=1;i<=n;++i)
        D[i][i]=A[p--];
    for (i=1;i<=n;++i)
        for (j=1;j<=n;++j)
            if (i!=j)
                D[i][j]=A[p--];
    for (i=1;i<=n;++i)
    {
        for (j=1;j<=n;++j)
            cout<<D[i][j]<<" ";
        cout<<"\n";
    }
    return 0;
}