#include<cstdio>
#include<algorithm>
using namespace std;

int N, i, x, a[500004];

int Part(int left, int right){
    int index, pivot, i, j;

    index = left + rand() % (right - left + 1);;
    pivot = a[index];
    i = left - 1;
    j = right + 1;
    while(1){
        do {++i;}while(a[i] < pivot);
        do {--j;}while(a[j] > pivot);
        if(i < j){
            swap(a[i], a[j]);
        }else return j;
    }
}
void QuickSort(int left, int right){
    int m, sp;

    if (left < right){
        sp = Part(left, right);
        QuickSort(left, sp);
        QuickSort(sp + 1, right);
    }
}

int main() {

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

scanf("%d", &N);

for(i=0; i<N; i++){
    scanf("%d", &a[i]);
}
QuickSort(0, N-1);

for(i=0; i<N; i++){
    printf("%d ", a[i]);
}
return 0;
}