#include <cstdio>
#include <algorithm>
#include <iostream>
#include <queue>
#include <cstdlib>
using namespace std;

const int NMAX = 500505;
int N, A[NMAX];

int compare(const void* a, const void* b) {
	return *(int*) a - *(int*) b;
}

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

	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	cin >> N;
	for (int idx = 1; idx <= N; idx++) {
		cin >> A[idx];
	}

	qsort(A + 1, N, sizeof(int), compare);
	for (int idx = 1; idx <= N; idx++) {
		cout << A[idx] << " ";
	}
	cout << "\n";
	return 0;
}