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

const int Nmax = 500005;

int n;
int v[Nmax];

int main() {
	freopen("algsort.in", "r", stdin);
	freopen("algsort.out", "w", stdout);


	scanf("%d", &n);
	for (int i = 1; i <= n; ++i)
		scanf("%d", &v[i]);
	sort(v + 1, v + n + 1);
	for (int i = 1; i <= n; ++i)
		printf("%d ", v[i]);

	return 0;
}