#include <cstdio>
#include <algorithm>

using namespace std;

int main()
{
	int *v,n;
	FILE *f=fopen("algsort.in","r");
	fscanf(f,"%d\n",&n);
	v=new int[n];
	for(int i=0;i<n;++i)
		fscanf(f,"%d ",&v[i]);
	make_heap(&v[0],&v[n]);
	sort_heap(&v[0],&v[n]);
	fclose(f);
	f=fopen("algsort.out","w");
	for(int i=0;i<n;++i)
		fprintf(f,"%d ",v[i]);
}