//甲级的可以通过，乙级的最后一个测试点没有通过
//运行时间问题，哪里的时间复杂度还可以在优化
#include<cstdio>
#include<algorithm>
#include<cmath>
using namespace std;
const int maxn = 10010;
int matrix[maxn][maxn],A[maxn];
bool cmp(int a,int b){return a > b;
}int main(){int N;scanf("%d",&N);for(int i = 0; i < N; i++){scanf("%d",&A[i]);}sort(A,A+N,cmp);if(N == 1){printf("%d",A[0]);return 0;}int m = (int)ceil(sqrt(1.0*N));while(N % m != 0) m++;int n = N/m,i = 1,j = 1,now = 0; //m is line,n is columnint U = 1,D = m,L = 1,R = n;while(now < N){while(now < N && j < R){ //forward to rightmatrix[i][j] = A[now++];j++;}while(now < N && i < D){matrix[i][j] = A[now++]; //to downi++;}while(now < N && j > L){  //forward to downmatrix[i][j] = A[now++];j--;}while(now < N && i > U){        //forward to leftmatrix[i][j] = A[now++];i--;}U++;D--;L++;R--;i++;j++;if(now == N - 1) matrix[i][j] = A[now++];}for(int i = 1; i <= m; i++){for(int j = 1; j <= n; j++){printf("%d",matrix[i][j]);if(j < n) printf(" ");else printf("\n");}}return 0;
} 

//网上的代码，暂留
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<cctype>
using namespace std;
int n;
void solve(){int a[n];for(int i=0;i<n;i++){scanf("%d",&a[i]);}sort(a,a+n);int x=sqrt(n),m;while(n%x){x--;}m=n/x;int t[m][x];for(int side=0,k=n-1;side*2<x;side++){for(int j=side;j<x-side;j++){t[side][j]=a[k--];}for(int i=side+1;i<m-side;i++){t[i][x-1-side]=a[k--];}for(int j=x-2-side;j>=side;j--){t[m-1-side][j]=a[k--];}if(x-1-side>side){for(int i=m-2-side;i>=side+1;i--){t[i][side]=a[k--];}}}for(int i=0;i<m;i++){for(int j=0;j<x;j++){printf("%d",t[i][j]);if(j+1<x){printf(" ");}}printf("\n");}
}
int main(){scanf("%d",&n);solve();return 0;
}