#include <fstream>
#include <algorithm>

using namespace std;

int v[500005];
char sir[1000005];

int main()
{
	int i,n,x,p;
	ifstream fin ("algsort.in");
	ofstream fout ("algsort.out");
	fin>>n;fin.get();
	fin.getline(sir, 1000000);
	i=1;p=0;x=0;
	while(sir[p])
	{
		if(sir[p]>='0' && sir[p]<='9')
			x=x*10+sir[p]-'0';
		else
		{
			v[i]=x;
			i++;
			x=0;
		}
		p++;
	}
	v[i]=x;
	sort(v+1,v+n+1);
	for(i=1;i<=n;i++)
		fout<<v[i]<<" ";
	fout<<"\n";
	return 0;
}