#include <iostream>
#include <vector>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <fstream>
#include <cctype>
#include <iomanip>
#include <cmath>
#include <cstring>
#include <map>
#include <bitset>

using namespace std;


int a[10001];

int main()
{
    //freopen("1.in","r",stdin);
    //freopen("1.out","w",stdout);
    int n;
    cin>>n;
    for(int i = 1; i <= n*n; i++)
        cin>>a[i];
    sort(a+1, a+ 1+n*n);

    int dr = n*n+1;
    int st = 0;
    for(int i = 1; i <= n; i++)
    {
        for(int j =1; j<=n;j++)
            if(i == j)
                cout<<a[--dr]<<' ';
            else cout<<a[++st]<<' ';
        cout<<'\n';

    }


    return 0;
}