#include <fstream>
using namespace std;

int n,i,a[502010],b[502020];

void interclasare(int a[], int l, int r)
{
	int m=(l+r)/2;
	int i,j,k;
	k=l-1;
	i=l;
	j=m+1;
	while(i<=m && j<=r)
	{
		if (a[i]<a[j])
		{
			k++;
			b[k]=a[i];
			i++;
		}
		else
		{
			k++;
			b[k]=a[j];
			j++;
		}
	}
		while(i<=m)
		{
			k++;
			b[k]=a[i];
			i++;
		}
	    while(j<=r)
		{
			k++;
			b[k]=a[j];
			j++;
		}
    
	for (i=l;i<=r;++i)
		a[i]=b[i];
}

void mergesort(int a[], int l, int r)
{
	if (l<r)
	{
	int m=(l+r)/2;
	mergesort(a,l,m);
	mergesort(a,m+1,r);
	interclasare(a,l,r);
	}
}

int main()
{
	
	ifstream f("algsort.in");
	ofstream g("algsort.out");
	
	f>>n;
	for (i=1;i<=n;i++)
		 f>>a[i];
	mergesort(a,1,n);
	
	for (i=1;i<=n;i++)
		 g<<a[i]<<" ";
	
	return 0;
}