#include <iostream>
#include <cstdio>
#include <algorithm>
#define f cin
#define g cout
#define NM 110

using namespace std;

int A[NM*NM];
int B[NM][NM];
int N;

int main()
{


    f >> N;
    for (int i=1; i<=N*N; i++)
        f >> A[i];

    sort(A+1, A+N*N+1, greater<int>());

    for (int i=1; i<=N; i++)
        B[i][i] = A[i];

    int k = N+1;
    for (int i=1; i<=N; i++) {
        for (int j=1; j<=N; j++)
        {
            if (i!=j)
                B[i][j] = A[k++];
            g << B[i][j] << ' ';
        }
        g << '\n';
    }

    return 0;
}