#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>

#define INF (1<<30)
#define mod 666013

using namespace std;
int n, m, i, j, q, v[10005], a[105][105];
int main()
{
    //freopen("1.in", "r", stdin);
    //freopen("1.out", "w", stdout);
    scanf("%d", &n);
    for(i=1;i<=n*n;i++)
        scanf("%d", &v[i]);
    sort(v+1, v+n*n+1);
    q=1;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            if(i!=j)
                a[i][j]=v[q++];
    for(i=1;i<=n;i++)
        a[i][i]=v[q++];

    for(i=1;i<=n;i++, printf("\n"))
        for(j=1;j<=n;j++)
            printf("%d ", a[i][j]);
    return 0;
}