#include <fstream>
using namespace std;

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

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

int main()
{
    int n;
    fin>>n;
    for (int i = 0; i<= n-1; i++)
        fin>>a[i];
    quicksort(a,0,n-1);
    for(int i = 0; i<=n-1;i++)
        fout<<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) && (i<=sup) && (j>=inf))
        {
            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);
}