#include <fstream>

using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int a[500000],n;
void quicksort(int ls,int ld)
{
    int i=ls, j=ld, m=(ls+ld)/2;
    while (i<=j)
    {
        while (a[i]<a[m])
            i++;
        while (a[m]<a[j])
            j--;
        if (i<=j)
        {
            swap (a[i],a[j]);
            i++;
            j--;
        }
    }
    if (ls<j) quicksort(ls,j);
    if (i<ld) quicksort(i,ld);
}
int main()
{
    fin>>n;
    for (int i=0; i<n; i++)
        fin>>a[i];
    quicksort(0,n-1);
    for (int i=0; i<n; i++)
        fout<<a[i]<<" ";
    return 0;
}