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

int N, myArray[1 << 19];

int Partition(int sequence[], int i, int j){
    int index, pivot;

    index = i + rand() % (j - i + 1);
    pivot = sequence[index];

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

    if(left < right){
        int split = Partition(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]);
}srand(time(NULL));

QuickSort(myArray, 0, N-1);

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