#include <stdio.h>
#define N 500001

int A[N],H;

void maxHeapify(i){
  int r,l,largest,tmp;
  l = i*2+1;
  r = i*2+2;
  if(l <= H && A[l] > A[i]) largest = l;
  else largest = i;
  if(r <= H && A[r] > A[largest]) largest = r;
  if(largest != i){
    tmp = A[i];
    A[i] = A[largest];
    A[largest] = tmp;
    maxHeapify(largest);
  }
}
void buildMaxHeap(){
  int i;
  for(i=H/2; i>=0; i--){
    maxHeapify(i);
  }
}
int main(){
  int i;
	scanf("%d",&H);
	for(i=0; i<H; i++){
		scanf("%d",&A[i]);
	}
  buildMaxHeap();
  for(i=0; i<H; i++) printf(" %d",A[i]);
  printf("\n");
  return 0;
}
