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

using namespace std;

ifstream in("algsort.in");
ofstream out("algsort.out");
int *a;
int n;

void quicksort(int x,int y)
{
    if(x<y)
    {
        int i = x,j=y,pivot = a[i];
        while(i<j)
        {
            if(a[i] > a[j])
                swap(a[i],a[j]);
            if(a[i]==pivot)
                j--;
            else
                i++;
        }
        int m = i;
        quicksort(x,m-1);
        quicksort(m+1,y);
    }
}

int main()
{
    in>>n;
    a = new int[n+1];
    for(int i=1;i<=n;i++)
        in>>a[i];
    in.close();
    ///
    quicksort(1,n);
    for(int i=1;i<=n;i++)
        out<<a[i]<<" ";
    out.close();
    ///
    delete[] a;
    return 0;
}