#include <fstream>
#include <algorithm>
using namespace std;
int n,i,a[101][101],b[101],t,j;
int main()
{
    ifstream cin ("a.in");
    ofstream cout ("a.out");
    cin>>n;
    for (i=1;i<=n*n;i++) cin>>b[i];
    sort(b+1,b+n*n+1);
    t=n*n+1;
    for (i=1;i<=n;i++) a[i][i]=b[--t];
    for (i=1;i<=n;i++)
        for (j=1;j<=n;j++)
            if (i!=j) a[i][j]=b[--t];
    for (i=1;i<=n;i++)
    {
        for (j=1;j<=n;j++) cout<<a[i][j]<<" ";
        cout<<'\n';
    }
    return 0;
}