#include <iostream>
#include <algorithm>
using namespace std;
int cmp(long long a, long long b)
{
    if(a<=b) return 0;
    return 1;
}
long long n,i,j,k;
long long a[100005];
long long mat[120][120];
int main()
{
    cin>>n;
    k=n*n;
    for(i=1;i<=n*n;++i) cin>>a[i];
    sort(a+1,a+1+n*n,cmp);
    for(i=1;i<=n;++i) mat[i][i]=a[i];
    for(i=1;i<=n;++i)
        for(j=1;j<=n;++j)
        {
            if(j>i) mat[i][j]=a[(i-1)*(n-1)+j-1+n];
            else if(j<i) mat[i][j]=a[(i-1)*(n-1)+j+n];
        }
    for(i=1;i<=n;++i)
    {
        for(j=1;j<=n;++j) cout<<mat[i][j]<<" ";
        cout<<'\n';
    }
    return 0;
}