#include<vector>
#include<fstream>
using namespace std;

void merge(vector<int>&, int, int, int);

void merge_sort(vector<int>& v, int left, int right)
{
	if(left==right)
		return;
	int mij=left+(right-left)/2;

	merge_sort(v,left,mij);
	merge_sort(v,mij+1,right);
	merge(v,left,mij,right);
}

void merge(vector<int>& v, int left, int mij, int right)
{
	vector<int> aux;

	int i=left,j=mij+1;

	while(i<=mij && j<=right)
	{
		if(v[i]<=v[j])
		{
			aux.push_back(v[i]);
			++i;
		}
		else
		{
			aux.push_back(v[j]);
			++j;
		}
	}

	while(i<=mij)
	{
		aux.push_back(v[i]);
		++i;
	}
	while(j<=right)
	{
		aux.push_back(v[j]);
		++j;
	}
	for(int i=left;i<=right;++i)
		v[i]=aux[i-left];
}

int main()
{
	ifstream in("algsort.in");
	ofstream out("algsort.out");
	int n;
	vector<int> v;
	in>>n;
	int nr;

	for(int i=0;i<n;++i)
	{
		in>>nr;
		v.push_back(nr);
	}
	merge_sort(v,0,n-1);

	for(int i=0;i<n;++i)
		out<<v[i]<<" ";
	out<<endl;
}