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

int N, myArray[1 << 19];

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

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

    if(left < right){
        int split = Part(sequence, left, right);
        QuickSort(sequence, left, split);
        QuickSort(sequence, split + 1, right);
    }
}

int main() {

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

scanf("%d", &N);

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

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