#include <iostream>
#include <stdlib.h>
#include <time.h>
#include <fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int n,v[500001],aux;
void QuickSort(int low,int high)
{
    if(low<high)
    {
        int pivot=v[low];
        int i=low+1,j=high;
        while(i<=j)
        {
            if(v[i]>=pivot)
            {
                if(v[j]<pivot)
                {
                    aux=v[i];
                    v[i]=v[j];
                    v[j]=aux;
                    i++;
                    j--;
                }
                else j--;
            }
            else i++;
        }
        aux=v[low];
        v[low]=v[j];
        v[j]=aux;
        QuickSort(low,j);
        QuickSort(j+1,high);
    }
}
int main()
{
    f>>n;
    for(int i=1; i<=n; i++)
        f>>v[i];

    QuickSort(1,n);

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

    return 0;
}