/*
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) {
	int i = start - 1;
	int j = stop;
    int temp = numere[(i + j) / 2];

    while (1) {
        while (numere[i] < temp)
            i++;
        while (numere[j] > temp)
            j--;
        if (i > j) 
            break;
        else {
            interschimb(&numere[i], &numere[j]);
            i++;
            j--;
        }
    }
    if (start < j)
        quicksort(start, j);
    if (i < stop)
        quicksort(i, stop);
}
 
int main () {
	FILE *f_in = fopen("algsort.in", "r");
	FILE *f_out = fopen("algsort.out", "w");

	int n;
	int i;

	fscanf(f_in, "%d", &n);
	for (i = 0; i < n; i++)
		fscanf(f_in, "%d", &numere[i]);
	quicksort(0, n - 1);
	for (i = 0; i < n; i++)
		fprintf(f_out, "%d ", numere[i]);
	return 0;
}