#include <stdio.h>
void maxHeapify(int);
void buildMaxHeap(void);
int H,A[500000];  
int main(){
  int i;
  scanf("%d",&H);
  for(i=0;i<H;i++){
    scanf("%d",&A[i]);
  } 
  
  buildMaxHeap();
  
  for(i=1;i<=H;i++){
    printf("%d ",A[i]);
  } 
  printf("\n");
  return 0;
}


void buildMaxHeap(void){
  int i;
  for(i=H/2;i>=1;i--)
    {
      maxHeapify(i);
    }
}


void maxHeapify(int i){
  int l,r,largest,tmp;
  l=i*2;
  r=i*2+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){
    tmp = A[i];
    A[i] = A[largest];
    A[largest] = tmp;
    maxHeapify(largest);
  }
}