#include<stdio.h>
using namespace std;
int a[500001],n;
void sort(int p,int q, int a[500001])
{
	int m;
	if(a[p]>a[q]) m=a[p],a[p]=a[q],a[q]=m;
}
void interclasare(int p,int q,int m,int a[5000001])
{
	int i,j,k=1,b[500001];
	i=p,j=m+1;
	while(i<=m && j<=q)
		if(a[i]<=a[j])
			b[k++]=a[i],++i;
		else
			b[k++]=a[j],++j;
	if(i<=m)
		for(j=i;j<=m;j++)
			b[k++]=a[j];
	else
		for(i=j;i<=q;i++)
			b[k++]=a[i];
	k=1;
	for(i=p;i<=q;i++)
		a[i]=b[k++];
}
void merge(int p,int q, int a[500001])
{
	int m;
	if((q-p)<=1)
		sort(p,q,a);
	else
	{
		m=(p+q)/2;
		merge(p,m,a);
		merge(m+1,q,a);
		interclasare(p,q,m,a);
	}
}
int main()
{
	int i;
	freopen("algsort.in","r",stdin);
	freopen("algsort.out","w",stdout);
	scanf("%d", &n);
	for(i=1;i<=n;i++)
		scanf("%d ",&a[i]);
	merge(1,n,a);
	for(i=1;i<=n;i++)
		printf("%d ",a[i]);
	return 0;
}