#include <fstream>
#include <cstring>
#include <algorithm>
using namespace std;

ifstream fin("algsort.in");
ofstream fout("algsort.out");

int i, N;
int H[500001];

void UP_heap(int u) {
	while (u != 1 && H[u] < H[u / 2]) swap(H[u / 2], H[u]), u /= 2;
}

void DOWN_heap(int u, int foo) {
	if (foo == 1) 
		swap(H[1], H[N--]);
	while (1) {
		int m = u;
		if (u * 2 <= N && H[u * 2] < H[m]) m = u * 2;
		if (u * 2 + 1 <= N && H[u * 2 + 1] < H[m]) m = u * 2 + 1;
		if (u == m) 
			break;
		swap(H[u], H[m]);
		u = m;
	}
}

int main() {
	fin >> N;
	for (i = 1; i <= N; ++i) 
		fin >> H[i];
	for (i = N / 2; i >= 1; --i)
		DOWN_heap(i, 0);
	while (N) {
		fout << H[1] << ' ';
		DOWN_heap(1, 1);
	}
	fout << '\n';
	return 0;
}