#include <fstream>
using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");
const int N = 500002, K = 10;
int v[N];
void insertSort(int st, int dr){
    int key, j;
    for(int i=st+1;i<=dr;i++){
        j = i-1;
        key = v[i];
        while(j >= st && v[j] > key)
            v[j+1] = v[j--];
        v[j+1] = key;
    }
}
int pivot(int st, int dr){
    int p = v[st], i = st - 1, j = dr + 1;
    while(1){
        do{
            i++;
        }while(v[i] < p);
        do{
            j--;
        }while(v[j] > p);
        if(i >= j)
            return j;
        swap(v[i],v[j]);
    }
}
void quickSort(int st, int dr){
    if(dr - st <= K)
        insertSort(st,dr);
    else
        while(st < dr){
            int p = pivot(st,dr);
            quickSort(st,p);
            st = p+1;
            p = dr;
        }
}
int main()
{
    int n;
    in>>n;
    for(int i=1;i<=n;i++)
        in>>v[i];
    in.close();
    quickSort(1,n);
    for(int i=1;i<=n;i++)
        out<<v[i]<<" ";
    out.close();
    return 0;
}