/*
Algoritm de sortare prin comparare - QuickSort.
*/

#include <stdio.h>
#include <stdlib.h>
#include <time.h>
 
#define MAX     500000 
int numere[MAX];

void interschimb (int *a, int *b) {
    int aux;
    aux = *a;
    *a = *b;
    *b = aux;
}

void quicksort (int start, int stop) {
    if (start >= stop)
        return;

	int i = start - 1;
	int j = stop;
    interschimb(&numere[start + rand() % (stop - start)], &numere[stop]);
    int temp = numere[stop];

    while (i < j) {
        while (i < j && numere[++i] < temp)
            ;
        while (i < j && numere[--j] > temp)
            ;
        interschimb(&numere[i], &numere[j]);
    }

    interschimb(&numere[i], &numere[stop]);
    quicksort(start, i - 1);
    quicksort(i + 1, stop);
} 

int main () {
    int n;
	int i;

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

	scanf("%d", &n);
	for (i = 0; i < n; i++)
		scanf("%d", &numere[i]);
	quicksort(0, n - 1);
	for (i = 0; i < n; i++)
		printf("%d ", numere[i]);
	return 0;
}