#include <fstream>
using namespace std;
int n , v[500005], tmp[500005],i;
ifstream in("algsort.in");
ofstream out("algsort.out");
void MergeSort(int st, int dr)
{
	if(st < dr)
	{
		int m = (st + dr) / 2;
		MergeSort(st , m);
		MergeSort(m + 1 , dr);
		int i = st, j = m + 1, k = 0;
		while( i <= m && j <= dr )
			if( v[i] < v[j])
				tmp[++k] = v[i++];
			else
				tmp[++k] = v[j++];
		while(i <= m)
			tmp[++k] = v[i++];
		while(j <= dr)
			tmp[++k] = v[j++];
		for(i = st , j = 1 ; i <= dr ; i ++ , j ++)
			v[i] = tmp[j];
	}
}
int main()
{
    in>>n;
    for(i=0;i<n;i++)
        in>>v[i];
    MergeSort(0,n-1);
    for(i=0;i<n;i++)
        out<<v[i]<<' ';
    return 0;
}