///https://infoarena.ro/problema/algsort
///QuickSort

#include <fstream>
#define DIM 500001

using namespace std;

ifstream fin ("algsort.in");
ofstream fout("algsort.out");

int n,i,v[DIM];
int pivot(int st, int dr)
{
    int di=0;
    int dj=-1;
    int i=st,j=dr;
    int aux;
    while(i<j)
    {
        if(v[i]>v[j])
        {
            aux=v[i];
            v[i]=v[j];
            v[j]=aux;
            aux=di;
            di=-dj;
            dj=-aux;
        }
        i+=di;
        j+=dj;
    }
    return i;
}
void quickSort(int st, int dr)
{
    if(st<dr)
    {
        int p=pivot(st,dr);
        quickSort(st,p-1);
        quickSort(p+1,dr);
    }
}
int main()
{
    fin>>n;
    for(i=1;i<=n;i++)
        fin>>v[i];
    quickSort(1,n);
    for(i=1;i<=n;i++)
        fout<<v[i]<<" ";
    return 0;
}