#include <fstream>
#include <time.h>
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
#define pb push_back
#define mp make_pair
#define sortvi(a) sort(a.begin(), a.end())
#define FOR(i, start, final) for (int i=start; i<=final; ++i)
#define ROF(i, start, final) for (int i=start; i>=final; --i)

#define f cin
#define g cout

//void f(int &x){char k;for(k=getchar();k<= 32;k=getchar());for(x=0;'0'<=k;k=getchar())x=x*10+k-'0';}


/*void f(int &x)//parsare cu semn
{
	char k; bool semn=0;
	for (k = getchar(); (k>'9' || k<'0');)
    {
        if (k=='-') semn=1;
        k=getchar();
    }
	for (x = 0; '0' <= k; k = getchar())	x = x * 10 + k - '0';
    if (semn==1) x=-x;
}*/


using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair < int, int> pi;
typedef vector< int > vi;
typedef vector< pair< int, int > > vpi;

int N, a[10005], sol[105][105], used[10005], last=1;

int main()
{
    f.sync_with_stdio(false);
    f>>N; last=N*N;
    FOR(i,1,N*N)f>>a[i];
    sort(a+1, a+N*N+1);
    FOR(i,1,N)
        sol[i][i]=a[N*N-i+1], used[N*N-i+1]=1, --last;

    for (int i=1; i<=N; ++i)
        for (int j=1; j<=N; ++j)
            if (sol[i][j]==0)
                sol[i][j]=a[last], --last;

    FOR(i,1,N)
    {
        FOR(j,1,N)
        g<<sol[i][j]<<' '; g<<'\n';
    }
    return 0;
}