#include<fstream>
#include<iostream>
#include<stdlib.h>

 using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");
const int N=500000;

//interclasarea vectorilor
void merge( int v[N],int a, int b)
{
	 int c[N],i=a,j,k=0,m=(int)(a+b)/2;
	 //c=( int *)malloc((a+b)*sizeof( int ));

	j=m+1;
	while(i<=m&&j<=b)
	{
		if(v[i]<=v[j])
			c[k++]=v[i++];
		else
			c[k++]=v[j++];
	}
	for(;i<=m;i++)
		c[k++]=v[i];
	for(;j<=b;j++)
		c[k++]=v[j];
	j=a;
	for(i=0;i<k;i++)
		v[j++]=c[i];
}
//impartirea vectorului in vectori mai mici
void divide_sort( int  v[N],int  a, int b)
{
	if(a<b)
	{
		 int m=(int)(a+b)/2;
		divide_sort(v,a,m);
		divide_sort(v,m+1,b);
		merge(v,a,b);
	}
}
int main()
{
	
	int v[N],n,i;
	in>>n;
	//dimensionarea vectorului la nivelul lui n
	//v=( int *)malloc(n*sizeof( int ));
	for(i=0;i<n;i++)
		in>>v[i];
	divide_sort(v,0,n-1);
	for(i=0;i<n;i++)
		out<<v[i]<<"\t";
	return 0;
}