#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn=100005;
int n,a[maxn];
// 3 2 8 4 5 3
// 2 2 8 4 5 3
// 
void quick(int l,int r){
    if(l>=r) return;
    int pivot=(l+r)>>1;swap(a[l],a[pivot]);
    int left=l,right=r,x=a[l];
    while(left<right){
        while(right>left&&a[right]>=x)   right--;
        if(right>left) a[left++]=a[right];
        while(left<right&&a[left]<=x)    left++;
        if(left<right) a[right--]=a[left];
    }
    a[left]=x;
    for(int i=0;i<n;++i) printf("%d,",a[i]);printf("\n");
    quick(l,left-1);quick(left+1,r);
}
int main(){
    while(~scanf("%d",&n)){
        for(int i=0;i<n;++i) scanf("%d",&a[i]);
        quick(0,n-1);
        for(int i=0;i<n;++i) printf("%d,",a[i]);printf("\n");
    }
    return 0;
}