#include <stdio.h>
#define dim 500100

int n, v[dim];

void quicksort(int *v, int lo, int hi)
{
	int i=lo, j=hi, x=v[(lo+hi)/2], h;
	do
	{
		while (v[i]<x) i++;
		while (v[j]>x) j--;
		if (i<=j)
		{
			h=v[i], v[i]=v[j], v[j]=h;
			i++, j--;
		}
	} while (i<=j);
	if (i<hi) quicksort(v, i, hi);
	if (lo<j) quicksort(v, lo, j);
}

int main()
{
	int i;
	freopen("algsort.in", "r", stdin);
	freopen("algsort.out", "w", stdout);
	scanf("%d\n", &n);
	for (i=0; i<n; i++) scanf("%d ", &v[i]);
	quicksort(v, 0, n-1);
	for (i=0; i<n; i++) printf("%d ", v[i]);
	printf("\n");
	return 0;
}