#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; i--; j++;

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

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

    if(left < right){
        int split = Partition(sequence, left, right);
        QuickSort(sequence, left, split - 1);
        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;
}