#include <fstream>

using namespace std;

void quicksort(long a[],long li,long lf)
{
    long ind = (li+lf)/2;
    long i=li,j=lf;
    long elem = a[ind];
    while(i<=j)
    {
        while(elem>a[i]) i++;
        while(elem<a[j]) j--;

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

    if(li<j) quicksort(a,li,j);
    if(lf>i) quicksort(a,i,lf);

}

int main()
{
    ifstream f("algsort.in");
    ofstream f2("algsort.out");
    long a[500001];
    long n;
    f>>n;
    for(long i=0;i<n;i++) f>>a[i];

    quicksort(a,0,n-1);

    for(long i=0;i<n;i++) f2<<a[i]<<" ";

    f.close();
    f2.close();
    return 0;
}