#include <fstream>
#include <algorithm>
#define NMAX  500005
using namespace std;
int v[NMAX];
void quickSort(int ii,int is){
    int i = ii;
    int j = is;
    int aux=v[ii + (is-ii)/2];
    while(ii <= is){
        while(v[ii]<aux)    ii++;
        while(v[is]>=aux && is > i)    is--;
        if(ii <= is)
            swap(v[ii++],v[is--]);
    }
    if(i < is)
        quickSort(i,is);
    if(j > ii)
        quickSort(ii,j);

}

int main()
{
    int n;
    ifstream f("algsort.in");
    ofstream g("algsort.out");
    f >> n;
    for(int i=0;i<n;i++)
        f >> v[i];
    quickSort(0,n -1);
    for(int i=0;i<n;i++)
        g << v[i] << " ";
    return 0;
}