#include <fstream>
#define maxn 500001

using namespace std;

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

int v[maxn],n;

void quicksort (int p, int q)
{
    if (q<=p) return;

    int x=v[p],i=p-1,j=q+1;
    while (i<j)
    {
        do i++; while (v[i]<x);
        do j--; while (v[j]>x);
        if (i<j)
        {
            v[i]^=v[j];
            v[j]^=v[i];
            v[i]^=v[j];
        }
    }

    quicksort (p,j);
    quicksort (j+1,q);
}

int main()
{
    fin>>n;
    for (int i=1; i<=n; ++i) fin>>v[i];

    quicksort (1,n);

    for (int i=1; i<=n; ++i) fout<<v[i]<<" ";
}