#include<cstdio>
#include<fstream>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<vector>
#include<bitset>
#include<deque>
#include<queue>
#include<set>
#include<map>
#include<cmath>
#include<cstring>
#include<ctime>
#include<cstdlib>
#include<unordered_map>

#define ll long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<ll,ll>
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second

using namespace std;

int n, i, j, A, B, a[10005];

int main()
{
    //    freopen("test.in", "r", stdin);
//    freopen("test.out", "w", stdout);

    scanf("%d", &n);

    for(i = 1; i <= n * n; i++)
        scanf("%d", &a[i]);

    sort(a + 1, a + n * n + 1, greater<int>());

    A = 1;
    B = n + 1;

    for(i = 1; i <= n; i++)
    {
        for(j = 1; j <= n; j++)
        {
            if(i == j) printf("%d ", a[A++]);
            else printf("%d ", a[B++]);
        }
        printf("\n");
    }

    return 0;
}