#include <iostream>
#include <algorithm>
#include <vector>
#include<cmath>

using namespace std;
#define STP system("pause")

int getrows(int data)
{
    for (int i = floor(sqrt(data)); i>0; i--)
    {
        if (data%i==0)
        {
            return data / i;
        }
    }
}

int main()
{
    int M,a;
    cin >> M;
    vector<int> v;
    for (int i = 0; i < M; i++)
    {
        cin >> a;
        v.push_back(a);
    }
    sort(v.begin(), v.end(), greater<int>());

    int rows = getrows(M);
    int cols = M / rows;

    int rows_bef = rows, cols_bef = cols;
    vector<vector<int>> vm(rows, vector<int>(cols));//定義一個矩陣

    int n = cols;
    int m = rows;
    int t = 0;
    int level = rows / 2 + rows % 2;
    for (int i = 0; i < level; i++) {
        for (int j = i; j <= n - 1 - i && t <= M - 1; j++)
            vm[i][j] = v[t++];
        for (int j = i + 1; j <= m - 2 - i && t <= M - 1; j++)
            vm[j][n - 1 - i] = v[t++];
        for (int j = n - i - 1; j >= i && t <= M - 1; j--)
            vm[m - 1 - i][j] = v[t++];
        for (int j = m - 2 - i; j >= i + 1 && t <= M - 1; j--)
            vm[j][i] = v[t++];
    }

    for (int i = 0; i < rows_bef; i++)
    {
        for (int j = 0; j < cols_bef; j++)
        {
            cout << vm[i][j];
            if (j!=cols-1)
            {
                cout << " ";
            }
        }
        cout << endl;
    }

    STP;
    return 0;
}