#include <bits/stdc++.h>

using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
const int N = 500002;
int n,a[N];
void quickSort(int,int);
int main()
{
    srand(time(0));
    f>>n;
    for(int i=1;i<=n;i++)
        f>>a[i];
    quickSort(1,n);
    for(int i=1;i<=n;i++)
        g<<a[i]<<' ';
    g<<'\n';
    return 0;
}
void quickSort(int lo,int hi)
{
    if(lo>=hi)
        return;
    /// se alege valoare pivot
    /// acesta se ia intr-o pozitie rnadom intre st si dr
    /// val minima - maxima dr-st
    int piv=a[lo];
    int st=lo,dr=hi;
    /// intervalul [lo,dr] sa contina valori <=piv
    /// intervalul [st,hi] sa contina valori >=piv
    do
    {
        while(a[st]<piv)st++;/// < sau <= ???
        while(a[dr]>piv)dr--;/// > sau >= ???
        if(st<=dr)
        {
            swap(a[st],a[dr]);
            st++;dr--;
        }
    }
    while(st<=dr);
    if(lo<dr)quickSort(lo,dr);
    if(st<hi)quickSort(st,hi);
}