#include <cstdio>
#define N 100
#include <algorithm>

using namespace std;
int a[N*N],x[N][N],i,j,n,nr;
int main()
{
//    freopen("a.in","r",stdin);
  //  freopen("a.out","w",stdout);

    scanf("%d",&n);
    for(i=1;i<=n*n;++i) scanf("%d",&a[i]);

    sort(a+1,a+n*n+1);

    for(i=1;i<=n;++i)
    x[i][i]=a[n*n-i+1];

    nr=0;
    for(i=1;i<=n;++i)
    for(j=1;j<=n;++j)
    if(i==j) ++nr;
    else x[i][j]=a[nr++];

    for(i=1;i<=n;++i)
    for(j=1;j<=n;++j)
    if(j<n) printf("%d ",x[i][j]);
    else printf("%d\n",x[i][j]);

    return 0;
}