#include <stdio.h>
#include <vector>
#include <algorithm>
using namespace std;

int n;
vector<int> v;

int main()
{
	int i;
	freopen("algsort.in", "r", stdin);
	freopen("algsort.out", "w", stdout);
	scanf("%d", &n);
	v.resize(n);
	for (i = 0; i < n; ++i)
	{
		scanf("%d", &v[i]);
	}
	sort(v.begin(), v.end());
	for (i = 0; i < n; ++i)
	{
		printf("%d ", v[i]);
	}
	return 0;
}