#include <stdio.h>
#define M 2000000


int H,A[M+1];

void maxheapify(int i){
  int l,r,largest,cng;

  l=2*i;
  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){
    cng=A[largest];
    A[largest]=A[i];
    A[i]=cng;
    maxheapify(largest);
  }
}

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;
}
