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

int n,a;
vector <int> x;

int main()
{
	ifstream f ("algsort.in");
	ofstream g ("algsort.out");
	
	f >> n ;
	for (int i = 1 ; i <= n ; i++)
	{
		f >> a;
		x.push_back (a);
	}
	
	sort(x.begin(), x.end());
	
	for (int i = 0 ; i < n ; i++)
		g << x[i] << " ";

	return 0;
}