#include<stdio.h>
int H;
void maxHeapify(int* ,int);
void buildMaxHeap(int*);
int main(){
  int i,A[100001];
  scanf("%d",&H);
  for(i=1;i<=H;i++) scanf("%d",&A[i]);
  buildMaxHeap(A);
  for(i=1;i<=H;i++) printf(" %d",A[i]);
  printf("\n");
  return 0;
}
void maxHeapify(int* A,int i){
  int l,r,largest;
  int 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(A,largest);
  }
}
void buildMaxHeap(int* A){
int i;
for(i=H/2;i>=1;i--) maxHeapify(A,i);
}





