#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] = v;
    }

}

void quick(int l, int r){

    if(r - l > 7){

    int aux, mid = (l + r) >> 1, min2;
/*    if(a[l] > a[r]) aux = a[r], a[r] = a[l], a[l] = aux;
    if(a[l] <= a[mid] && a[mid] <= a[r]) min2 = mid;
    if(a[mid] <= a[l]) min2 = l;
    if(a[r] <= a[mid]) min2 = r;
    aux = a[r], a[r] = a[min2], a[min2] = aux;
*/

    aux = a[mid], a[mid] = a[r], a[r] = aux;
    int i = l, j = r, v = aux;
    while(i < j){
        while(i < j && a[i] <= v) i++;
        while(i < j && a[j] >= v) j--;
        if(i < j) aux = a[i], a[i] = a[j], a[j] = aux;
    }
    aux = a[r], a[r] = a[j], a[j] = aux;

        quick(l, j-1);
        quick(j+1, r);
    }
    else insertion(r, l);
}

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;
}