#include <cstdio>
#include <algorithm>

using namespace std;

const int N = 102;

int a [N * N], b [N][N];

int main () {
    int n, lim, i, j, k;

    /*freopen ("a.in", "r", stdin);
    freopen ("a.out", "w", stdout);*/

    scanf ("%d", &n);
    lim = n * n;
    for (i = 1; i <= lim; i ++) {
        scanf ("%d", &a [i]);
    }
    sort (a + 1, a + 1 + lim);
    for (i = 1, k = lim; i <= n; i ++, k --)
        b [i][i] = a [k];
    for (i = 1; i <= n; i ++)
        for (j = 1; j <= n; j ++)
            if (i != j) {
                b [i][j] = a [k];
                -- k;
    }
    for (i = 1; i <= n; i ++) {
        for (j = 1; j <= n; j ++)
            printf ("%d ", b [i][j]);
        printf ("\n");
    }
    return 0;
}