#include<stdio.h>
#define MAX 2000000
int A[MAX+1],H;
void maxHeapify(int);
int left(int l){
  return 2*l;
}
int right(int r){
  return 2*r+1;
}
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;
}
void maxHeapify(int i){
  int l,r,largest,t;
  l=left(i);
  r=right(i);
  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);
  }
  
}

