#include<fstream>
using namespace std;

ifstream f("sortare.in");
ofstream g("sortare.out");

int a[3000001],n,i;

void quicksort(int s, int d)
{
    int t;
    int i = s;
    int j = d;
    int p = a[(i+j)/2];

    while (i<j)
    {
        while (a[i]<p)
            i++;
        while (a[j]>p)
            j--;

        if (i<=j)
        {
            t = a[i];
            a[i] = a[j];
            a[j] = t;
            i++; j--;
        }
    }

    if (s<j)
        quicksort(s,j);

    if (i<d)
        quicksort(i,d);
}

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

    quicksort(1,n);

    for(i=1;i<=n;i++)
        g<<a[i]<<" ";

    return 0;
}