#include<algorithm>
#include<fstream>
using namespace std;
#define nmax 50001
long long v[nmax];
int main()
{
	ifstream fin("algsort.in");
	int i,n;
	fin >> n;
	for (i = 1; i <= n; i++)
		fin >> v[i];
	fin.close ();
	sort (v+1, v+n+1);
	ofstream fout("algsort.out");
	for (i = 1; i <= n; i++)
		fout << v[i] << " "; 
	fout.close ();
	return 0;
}