// quicksort
#include <iostream>
#include <cstdlib>
#include <fstream>
using namespace std;
int arr[500010];

ifstream f("algsort.in");
ofstream g("algsort.out");

int compare(const void* a, const void* b){
	const int* x = (int*) a;
	const int* y = (int*) b;
	if (*x > *y)
		return 1;
	else if (*x < *y)
		return -1;
	return 0;
}

int main(){
    int n;
    f >> n;
    for (int i = 0; i < n; ++i)
        f >> arr[i];
	
	qsort(arr, n, sizeof(int), compare);

	for (int i = 0; i < n; i++)
		g << arr[i] << " ";
	return 0;
}