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

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

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];
	}

	priority_queue<int, vector<int>, greater<int>> minHeap;
	for (int idx = 1; idx <= N; idx++) {
		minHeap.push(A[idx]);
	}

	for (int idx = 1; idx <= N; idx++) {
		int topElem = minHeap.top();
		minHeap.pop();
		if (idx > 1) {
			cout << " ";
		}
		cout << topElem;
	}
	cout << "\n";
	return 0;
}