#include <stdio.h>
#include <algorithm>
using namespace std;
#define LIM 500005
FILE *f=fopen("algsort.in", "r"), *g=fopen("algsort.out", "w");
long v[LIM], sw, n, i, aux;

inline void swap(long &a, long &b)
{
	long aux;
	aux=a;
	a=b;
	b=aux;
}

void shell()
{
	long inj;
	inj=n;
	while(inj>1)
	{
		inj/=2;	
		do
		{
			sw=0;
			for (i=1;i<=n-inj;i++)
				if (v[i]>v[i+inj])
				{
					sw=1;
					swap(v[i], v[i+inj]);
				}
		}while(sw);
	}
}

void tipareste()
{
	for (i=1;i<=n;i++)
		fprintf(g, "%ld ", v[i]);
}

int main()
{
	fscanf(f, "%ld", &n);
	for (i=1;i<=n;i++)
		fscanf(f, "%ld", &v[i]);
	//shell();
	sort(v+1, v+n+1);
	tipareste();
	fclose(f);
	fclose(g);
	return 0;
}