#include <fstream>

using namespace std;

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

void quicksort(int a[] ,int inf, int sup);

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

void quicksort(int a[] , int inf, int sup)
{
    int pivot = a[(inf+sup)/2];
    int aux;
    int i = inf;
    int j = sup;
    while (i<=j)
    {
        while (a[i] <pivot)
            i++;
        while(a[j]>pivot)
            j--;
        if (i<=j)
        {
            aux = a[i];
            a[i] = a[j];
            a[j] = aux;
            i++;
            j--;
        }
    }
    if (j>inf) quicksort(a,inf,j);
    if (i<sup) quicksort(a,i,sup);
}