#include <cstdio>
#include <cstring>
#include <algorithm>

using namespace std;

inline int next_int() {
	int d;
	scanf("%d", &d);
	return d;
}

int A[1 << 20];

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