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

vector <int> x;
int n, a;

int main ()
{
	freopen ("algsort.in", "rt", stdin);
	freopen ("algsort.out", "wt", stdout);

	scanf("%d", &n);
	for (long i = 0; i < n; ++i)
	{
		scanf("%d", &a);
		x.push_back(a);
	}

	sort(x.begin(), x.end());

	for (long i = 0; i < n; ++i)
		printf("%d ", x[i]);

	printf("\n");
	return 0;
}