#include<bits/stdc++.h>
using namespace std;
int pivot(vector<int> &arr,int low,int high)
{
    int i=low;
    int j=high;
    int piv=low;
    while(i<j)
    {
        if(arr[i]>arr[piv] && arr[j]>arr[piv])
        {
            swap(arr[i],arr[j]);
            i++;
            j--;
        }
        while(arr[i]<=arr[piv] && i<=high)
        i++;
        while(arr[j]>arr[piv] && j>=low)
        j--;
    }
    for(auto it:arr)
    cout<<it<<" ";
    cout<<endl;
    swap(arr[j],arr[piv]);
    return j;
}

void quickSort(vector<int> &arr,int low,int high)
{
    if(low>=high)
    return;
    int piv=pivot(arr,low,high);
    quickSort(arr,low,piv-1);
    quickSort(arr,piv+1,high);
}

int main()
{
    int n;
    cin >> n;
    
    vector<int> arr(n);
    
    for(int i=0;i<n;i++)
    cin >> arr[i];
    
    quickSort(arr,0,n-1);
    
    for(auto it:arr)
    cout<<it<<" ";
}