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

list <int> V;
int N;

int main ()
{
	ifstream fin ("algsort.in");
	ofstream fout ("algsort.out");
	
	fin>>N;
	for (int i=0; i<N; ++i)
	{
		int x;
	
		fin>>x;
		V.push_back (x);
	}
	
	sort (V.begin (),V.end ());
	
	for (int i=0; i<N; ++i)
	{
		fout<<*(V.begin ())<<" ";
		V.pop_front ();
	}
	
	return 0;
}