#include <iostream>
#include <fstream>
#include <cstdlib>

using namespace std;
# define MaxN 500000
int v[MaxN];
void quicksort(int b, int e){
    int pivot=v[b+rand()%(e-b+1)];
    int i=b, j=e;
    while(v[i]<pivot)
        i++;
    while(v[j]>pivot)
        j--;
    while(i<j){
        swap(v[i], v[j]);
        i++;
        j--;
        while(v[i]<pivot) i++;
        while(v[j]>pivot) j--;
    }
    if(b<j)
        quicksort(b, j);
    if(j+1<e)
        quicksort(j+1, e);
}
int main()
{
    ifstream in("algsort.in");
    ofstream out("algsort.out");
    int n, i;
    in>>n;
    for(i=0; i<n; i++){
        in>>v[i];
    }
    quicksort(0, n-1);
    for(i=0; i<n; i++)
    {
        out<<v[i]<<" ";
    }
    return 0;
}