#include <fstream>

using namespace std;

int a[500001];

void insertion(int l, int r){
    int i, j, v;
    for(i = l + 1; i <= r; i++){
        v = a[i];
        j = i - 1;
        while(j >= l && a[j] > v) {a[j+1] = a[j]; j--;}
        a[j+1] = v;
    }

}

void quick(int l, int r){

    if(r - l - 1 > 8){

    int aux, m = l, i;
    for(i = l + 1; i <= r; i++)
        if(a[i] < a[l])
            aux = a[i], a[i] = a[++m], a[m] = aux;
        aux = a[l], a[l] = a[m], a[m] = aux;
        quick(l, m-1);
        quick(m+1, r);
    }
    else insertion(l, r);
}

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