#include <stdio.h>
#include <algorithm>

int v[(int)5e5], N;
void quicksort_valoros(int st, int dr) {
    if(st >= dr)
        return ;
    int mid = (st + dr) >> 1;
    std :: nth_element(v + st, v + mid, v + dr + 1);
    quicksort_valoros(st, mid - 1);
    quicksort_valoros(mid + 1, dr);
}

int main() {
    freopen("algsort.in", "r", stdin);
    freopen("algsort.out", "w", stdout);

    scanf("%d", &N);
    for(register int i = 0; i < N; ++ i)
       scanf("%d", &v[i]);

    quicksort_valoros(0, N - 1);

    for(register int i = 0; i < N; ++ i)
        printf("%d ", v[i]);
    printf("\n");
    return 0;
}