#include <iostream>
#include<vector>
#include<algorithm>
#include<cmath>
#include<set>
#include<queue>
#include<stack>
#include<string>
#include<cstring>

using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<long long> numbers;

    for(int i = 0; i < n*n; i++){
            long long a;
        cin >> a;
        numbers.push_back(a);
    }

    sort(numbers.begin(), numbers.end());
    int p1 = 0; int pEnd = n*n-1;
    long long num;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            if(i == j){
                num = numbers[pEnd];
                pEnd--;
            }else{
                num = numbers[p1];
                p1++;
            }

            if(j != n-1){
                cout << num << " ";
            }else{
                cout << num;
            }
        }
        cout << endl;
    }
    //cout << "Hello world!" << endl;
    return 0;
}