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

#define N 500005

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

int v[N], n;

int main() {
	fin >> n;
	for (int i = 0; i < n; ++i)
		fin >> v[i];
	fin.close();
	make_heap(v, v+n);
	sort_heap(v, v+n);
	for (int i = 0; i < n; ++i)
		fout << v[i] << " ";
	fout.close();
	return 0;
}