#include <iostream>
#include <algorithm>

using namespace std;

int a[10005], b[10001];
int m[101][101];

int main()
{
    int n;
    cin>>n;

    for(int i=1;i<=n*n;++i)
    {
        cin>>a[i];
        b[i] = a[i];

    }
    sort(a+1,a+n*n+1);
    int j=1;
    for(int i=n*n;i>n*n-n;i--)
    {
        m[j][j] = a[i];
        b[i] = -1;
        j++;
    }
    int nr = 1;
    for(int i=1;i<=n;++i)
    {
        for(int j=1;j<=n;++j)
        {
            if(i != j && b[i] >= 0)
                m[i][j] = a[nr],nr++;
        }

    }
    for(int i=1;i<=n;++i)
    {
        for(int j=1;j<=n;++j)
            cout<<m[i][j]<<" ";
        cout<<'\n';
    }





           

    return 0;
}