#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;
int n;
int m[110][110];
vector<int> numbers;

int main () {


    scanf("%d", &n);
    int x;
    for (int i=0; i<n*n; ++i) {
        scanf("%d", &x);
        numbers.push_back(x);
    }

    sort(numbers.begin(), numbers.end());

        int len = numbers.size()-1;
    for (int i=0; i<n; ++i)
        m[i][i] = numbers[len--];
    for (int i=0; i<n; ++i)
        for (int j=0; j<n; ++j)
            if (i!=j)
                m[i][j] = numbers[len--];


    for (int i=0; i<n; ++i) {
        for (int j=0; j<n; ++j)
            printf("%d ", m[i][j]);
        printf("\n");
    }

    return 0;
}