#include <iostream>
#include <algorithm>
using namespace std;

int n,mat[120][120],a[100004],i,j,k;

int main()
{
    cin>>n;
    for (i=1;i<=n*n;i++)
     cin>>a[i];
    for (i=1;i<=n;i++)
     for (j=1;j<=n;j++)
      mat[i][j]=-911;
    sort(a+1,a+n*n+1);
    i=n*n; j=1;
    while (j<=n)
    {
        mat[j][j]=a[i];
        i--;j++;
    }
    k=1;
    for (i=1;i<=n;i++)
     for (j=1;j<=n;j++)
      if (mat[i][j]==-911)
       {
           mat[i][j]=a[k++];
       }
    for (i=1;i<=n;i++)
    {
        for (j=1;j<=n;j++)
         cout<<mat[i][j]<<" ";
        cout<<'\n';
    }
    return 0;
}