#include <iostream>
#include <fstream>
#include <algorithm>
#include <cstring>

#define DN 104
using namespace std;

int v[DN*DN],n;
int rez[DN][DN];

ifstream f("test.in");

void read(){

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

}

void solve(){

    memset(rez,-1,sizeof(rez));
    sort(v+1,v+n*n+1);

    int k = 1;
    for(int i=n*n;i>=n*n-n;--i,++k)
        rez[k][k] = v[i];

    k = 1;
    for(int i=1;i<=n;++i,cout<<"\n")
        for(int j=1;j<=n;++j)
            if(rez[i][j] == -1)
                cout<<v[k++]<<" ";
            else
                cout<<rez[i][j]<<" ";
}

int main()
{
    read();
    solve();


    return 0;
}