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

ifstream is("algsort.in");
ofstream os("algsort.out");

int n;
vector<int> a;

int main()
{
	is >> n;
	int x;
	a = vector<int>(n+1);
	for(int i = 1; i <= n; ++i)
	{
		is >> x;
		a[i] = x;
	}
	sort(a.begin(), a.end());
	for(int i = 1; i <= n; ++i)
	{
		os << a[i] << ' ';
	}
	is.close();
	os.close();
	return 0;
}