#define IA_PROB "algsort"

#include <cassert>
#include <cstdio>
#include <cstring>

#include <iostream>
#include <fstream>

#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>

#include <algorithm>

using namespace std;


void my_insertion_sort(int *v, int l, int r) {
	for (int i = l; i < r; i++) {
		int j, x = v[i];
		for (j = i - 1; j >= l && v[j] > x; j--) {
			v[j + 1] = v[j];
		}
		v[j + 1] = x;
	}
}

int rand_int(int l, int r) {
	assert(l < r);
	return l + rand() % (r - l);
}

int get_pivot(int *v, int l, int r) {
	return rand_int(l, r);
}

/** Partitions v as such: [ < )[ >= )
 * This is so that we don't need to move/swap elements that are equal to the pivot
 * @return the index of the common boundary (lt_hi == ge_lo) */
int partition(int *v, int l, int r, int pivot) {
	int boundary = l;
	for (int i = l; i < r; i++) {
		if (v[i] < pivot) {
			swap(v[i], v[boundary]);
			boundary++;
		}
	}
	return boundary;
}

void my_qsort_impl(int *v, int l, int r, int threshold) {
	int n = r - l;
	if (n <= 1) {
		return;
	} else if (n <= threshold) {
		my_insertion_sort(v, l, r);
		return;
	}
	swap(v[r - 1], v[get_pivot(v, l, r)]); // select random pivot and bring it to the last position
	int boundary = partition(v, l, r - 1, v[r - 1]); // partition
	swap(v[r - 1], v[boundary]); // bring pivot to its final position
	my_qsort_impl(v, l, boundary, threshold); // don't include the pivot (otherwise we'd risk entering an infinite loop)
	my_qsort_impl(v, boundary + 1, r, threshold); // again, don't include the pivot
}

void merge(int *v, int *w, int l, int m, int r) {
	int i = l, j = m, k = l;
	while (i < m && j < r) {
		if (v[i] < v[j]) w[k++] = v[i++];
		else w[k++] = v[j++];
	}
	while (i < m) w[k++] = v[i++];
	while (j < r) w[k++] = v[j++];
	assert(k == r);
	memcpy(&v[l], &w[l], (r - l) * sizeof(int));
}

void my_merge_sort_impl(int *v, int *w, int l, int r, int threshold) {
	int n = r - l;
	assert(n >= 1);
	if (n == 1) {
		return;
	} else if (n <= threshold) {
		my_insertion_sort(v, l, r);
		return;
	}
	int m = l + (r - l) / 2;
	my_merge_sort_impl(v, w, l, m, threshold);
	my_merge_sort_impl(v, w, m, r, threshold);

	merge(v, w, l, m, r);
}

void my_qsort(int *v, int n) {
	srand(time(0));
	my_qsort_impl(v, 0, n, 100);
}

void my_merge_sort(int *v, int n) {
	if (n <= 0) return;
	int *w = (int*) malloc(n * sizeof(int));
	my_merge_sort_impl(v, w, 0, n, 100);
	free(w);
}

template <class T>
class Heap {
protected:
	vector<T> v;

	int p(int i) { return i / 2; }
	int l(int i) { return i * 2 + 0; }
	int r(int i) { return i * 2 + 1; }

	void sift(int i) {
		int c = i;
		if (l(i) < v.size() && v[l(i)] < v[c]) c = l(i);
		if (r(i) < v.size() && v[r(i)] < v[c]) c = r(i);
		if (c != i) {
			swap(v[c], v[i]);
			sift(c);
		}
	}

	void build_heap() {
		for (int i = v.size() / 2; i >= 1; i--) {
			sift(i);
		}
	}
public:
	Heap(T *v, int n) {
		T root_value;
		memset(&root_value, -1, sizeof(T));
		this->v.push_back(root_value);
		this->v.insert(this->v.end(), v, v + n);
		build_heap();
	}
	int pop() {
		int min = this->v[1];
		this->v[1] = this->v.back();
		this->v.pop_back();
		sift(1);
		return min;
	}
};

void my_heap_sort(int *v, int n) {
	Heap<int> heap(v, n);
	for (int i = 0; i < n; i++) {
		v[i] = heap.pop();
	}
}

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

	int n;
    scanf("%d", &n);
    assert(n > 0);

    int *v = (int*)malloc(n * sizeof(int));
    for (int i = 0; i < n; i++) {
    	scanf("%d", &v[i]);
    }

//    my_qsort(v, n);
//    my_merge_sort(v, n);
    my_heap_sort(v, n);

    for (int i = 0; i < n; i++) {
		printf("%d ", v[i]);
	}

    return 0;
}