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

int N, myArray[1 << 19];

int LomutoPartition(int sequence[], int left, int right){
    int pivot = sequence[right];
    int i = left - 1;

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

    if(left < right){
        int split = LomutoPartition(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;
}