#include <fstream>
#include <iostream>
#include <algorithm>

using namespace std;
ifstream f("algsort.in");
ofstream f2("algsort.out");
int aux[500001],v[500001];
int partition(int v[], int st, int dr, int pivot)
{
    int ind = st+ rand()% (dr-st);

    for(int i=st; i<=dr; i++)
    {

        if(v[i]<=pivot)
        {

            swap(v[ind],v[i]);
            ind++;
        }
    }

    ind--;

    return ind;
}
void quickSort(int v[], int st, int dr)
{
    if(st < dr)
    {
        int pivot = v[dr];
        int ind = partition(v, st, dr, pivot);
        quickSort(v, st, ind-1);
        quickSort(v, ind+1, dr);
    }
}

int main()
{
    int i,n;
    f>>n;
    for(i=0; i<n; i++)
        f>>v[i];
    quickSort(v, 0, n-1);
    for(i=0; i<n; i++)
        f2<<v[i]<<" ";


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