#include<cstdio>
#include<queue>
using namespace std;
#define NM 500001
int v[NM],p[NM];
void mergesort(int x, int y)
{
	if (x==y)
		return;
	mergesort(x,(x+y)>>1);
	mergesort(((x+y)>>1)+1,y);
	int N=(x+y)>>1,i,j;
	p[0]=0;
	for (i=x,j=N+1; i<=N && j<=y; )
	{
		if (v[i]<v[j])
		{
			p[++p[0]]=v[i];
			++i;
			continue;
		}
		if (v[i]>v[j])
		{
			p[++p[0]]=v[j];
			++j;
			continue;
		}
		p[++p[0]]=v[i];
		p[++p[0]]=v[j];
		++i;
		++j;
	}
	while (i<=N)
	{
		p[++p[0]]=v[i];
		++i;
	}
	while (j<=y)
	{
		p[++p[0]]=v[j];
		++j;
	}
	for (i=x,j=1; i<=y; ++i,++j)
		v[i]=p[j];
}
void afis(int N)
{
	for (int i=1; i<=N; ++i)
		printf("%d ",v[i]);
}
int main()
{
	freopen("algsort.in","r",stdin);
	freopen("algsort.out","w",stdout);
	int N;
	scanf("%d",&N);
	for(int i=1; i<=N; ++i)
		scanf("%d",&v[i]);
	mergesort(1,N);
	afis(N);
	return 0;
}