#include <iostream>
#include <stdlib.h>
using namespace std;
int cmp(const void *a,const void *b){
    return ( *(int*)a - *(int*)b );
}
int main()
{
    int n,a[10001];
    cin>>n;
    for(int i=0;i<n*n;i++)
        cin>>a[i];
    qsort(a,n*n,sizeof(int),cmp);
    for(int i=0;i<n;i++){
       for(int j=0;j<n;j++){
            if(i==j && i!=n-1){
                if(i!=0){
                cout<<a[n*n-i-1]<<" ";
                a[n*n-i-1]=a[i*n+j];}else {
                 cout<<a[n*(n-1)]<<" ";
                a[n*(n-1)]=a[i*n+j];
                }
                }
            else cout<<a[i*n+j]<<" ";

       }cout<<endl;}
}