#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<time.h>
#include<math.h>
int A[500010],H;
void MaxHeapify(int i)
{
	int t;
	int l=2*i;
	int largest;
	int r=2*i+1;
	if(l<=H && A[l]>A[i])
		largest=l;
	else
		largest=i;
	if(r<=H && A[r]>A[largest])
		largest=r;

	if(largest!=i)
	{
		t=A[i];
		A[i]=A[largest];
		A[largest]=t;

		MaxHeapify(largest);
	}
	return;
}
int main()
{
	int i;
	scanf("%d",&H);
	for(i=1;i<=H;i++)
		scanf("%d",&A[i]);

	for(i=H/2;i>=1;i--)
		MaxHeapify(i);

	for(i=1;i<=H;i++)
		printf(" %d",A[i]);
	printf("\n");

	return 0;
}
