#include<fstream>
#include<algorithm>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");
int i,n,v[500001];
int main()
{   fin >> n;
    for (i=1;i<=n;++i)
		fin >> v[i];
	make_heap(v+1,v+1+n);
	sort_heap(v+1,v+1+n);
	for (i=1;i<=n;++i)
		fout << v[i] << " ";
	return 0;
}