#include <iostream>
#include <algorithm>
using namespace std;
int a[500002];
int chosePivot(int l, int r)
{
    if((a[l]<=a[(l+r)/2])&&(a[(l+r)/2]<=a[r])) return (l+r)/2;
    if((a[l] <= a[r])&&(a[r] <= (a[(l+r)/2]))) return r;
    return l;
}
int Partition(int l, int r)
{
    int pind=chosePivot(l,r);
    int p=a[pind];
    int i,j=l-1;

    for(i=l;i<=r;i++)
    {
        if(a[i]<p)
        {
            swap(a[i],a[++j]);
            if(j==pind) pind=i;
        }
    }
    swap(a[pind],a[j+1]);
    return j+1;
}
void quicksort(int l, int r)
{
    if(l<r)
    {
        int p=Partition(l,r);
        quicksort(l,p-1);
        quicksort(p+1,r);
    }
}
int main()
{
    int i;
    freopen("algsort.in","r",stdin);
    freopen("algsort.out","w",stdout);
    int n;
    cin>>n;
    for(i=0;i<n;i++)
        scanf("%d",&a[i]);
    quicksort(0,n-1);
    for(int i=0;i<n;i++) cout<<a[i]<<" ";
}