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

int N, myArray[1 << 19];

int Partition(int sequence[], int left, int right){
    int pivot = sequence[right];
    int partitionIndex = left;
    for(int i = left; i < right; i++){
        if(sequence[i] <= pivot){
            swap(sequence[i], sequence[partitionIndex]);
            partitionIndex++;
        }
    }
    swap(sequence[partitionIndex], sequence[right]);
    return partitionIndex;
}
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;
}