#include <iostream>
#include <vector>

using namespace std;


void mergesort(vector<int>& v, int b, int e) {
	int m = (e + b) / 2;
	if (b < e) {
		mergesort(v, b, m);
		mergesort(v, m + 1, e);
	}
	else {
		return;
	}
	vector<int> temp;
	int i = b, j = m + 1;
	while (i <= m and j <= e) {
		if (v[i] > v[j]) {
			temp.push_back(v[j]);
			j++;
		}
		else {
			temp.push_back(v[i]);
			i++;
		}
	}
	if (i <= m) {
		while (i <= m) {
			temp.push_back(v[i]);
			i++;
		}
	}
	else if (j <= e) {
		while (j <= e) {
			temp.push_back(v[j]);
			j++;
		}
	}
	for (int k = b; k <= e; k++) {
		v[k] = temp[k - b];
	}

}





int main() {

	vector <int> v;
	int n;
	cin >> n;
	for (int i = 0; i < n; i++) {
		int val;
		cin >> val;
		v.push_back(val);
	}

	mergesort(v, 0, v.size() - 1);

	for (int i = 0; i < v.size(); i++) {
		cout << v[i] << " ";
	}

	return 0;
}