#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("algsort.in");
ofstream g ("algsort.out");
long n,v[500001];

void quicksort (long x[], long left, long right)
{
    long i=left,j=right;
    long aux;
    long pivot=x[(left+right)/2];
    while (i<=j)
    {
        while (x[i]<pivot)
            i++;
        while (x[j]>pivot)
            j--;
        if (i<=j)
        {
            aux=x[i];
            x[i]=x[j];
            x[j]=aux;
            i++;
            j--;
        }
    }
    if (left<j)
        quicksort(x,left,j);
    if (i<right)
        quicksort(x,i,right);
}


int main()
{
    f>>n;
    long i;
    for (i=1;i<=n;i++)
        f>>v[i];
    quicksort(v,1,n);
    for (i=1;i<=n;i++)
        g<<v[i]<<" ";
    f.close();g.close();
    return 0;
}