#include <stdio.h>
#include <algorithm>
using namespace std;
#define nmax 500005

int v[nmax];

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