#include <bits/stdc++.h>

using namespace std;

int V[500005], n;

void MergeSort() {
	for(int i = 1; i < n; i <<= 1) {
		for(int b = 0; b < n; b += (i + i)) {
			int m = min(b + i, n);
			int e = min(m + i, n);

			inplace_merge(V + b, V + m, V + e);
		}
	}
}

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

	cin >> n;
	for(int i = 0; i < n; ++i)
		cin >> V[i];

	MergeSort();
	
	for(int i = 0; i < n; ++i)
		cout << V[i] << " ";

	return 0;
}