#include <iostream>
#include <algorithm>

using namespace std;

int MAT[101][101];

bool cmp(const int &a, const int &b)
{
    return (a > b);
}

int main()
{
    int n;
    cin >> n;
    int A[100001];
    for( int i = 1; i <= n * n; ++i )
        cin >> A[i];
    int dim = n * n;
    sort( A + 1, A + 1 + dim, cmp );
    for( int i = 1; i <= n; ++i )
        MAT[i][i] = A[i];
    for( int i = n + 1; i <= n * n; )
    {
        for( int j = 1; j <= n; ++j )
            for( int k = 1; k <= n; ++k )
                if( !MAT[j][k] )
                    MAT[j][k] = A[i++];
    }

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