#include <iostream>
#include <algorithm>
#include <vector>

#define dim 10009
using namespace std;

int v[dim];
int main()
{

    int n ;
    cin >> n;
    int m = n * n;
    int k = 0;
    for( int i = 1 ;i<=m ; i++)
        cin >> v[i];

    sort(v+1,v+m+1);
    int i = 1;
    int lin = 0;
    k = m;
    int j = 1;
    while( i <= m )
    {
        int rest , div ;
        rest = i % n;
        div = i/n;
        if( div + 1 == rest )
        {
            cout << v[k] << " ";
            k--;
        }

        else
        {
            cout << v[j] << " ";
            j++;
        }

        if( i % n == 0 )
            cout << '\n';
        i++;
    }

    return 0;

}