#include<iostream>
#include<fstream>

#include<algorithm>
using namespace std;
int l,l1,x,n,v[10005];

int main()
{

   cin>>n;
    for(int i=1;i<=n*n;i++)
   cin>>v[i];
    sort(v+1,v+n*n+1);
    l=n*n;l1=1;
    for(int i=0;i<=n-1;i++)
        {for(int j=0;j<=n-1;j++)
        if(i==j)
          cout<<v[l--]<<" ";
else cout<<v[l1++]<<" ";
 cout<<"\n";}


    return 0;
}