#include<stdio.h>
#define N 500000
int H,A[N];
int maxHeapify(int i){
  int l,r,z,largest;
  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){
    z=A[i];
    A[i]=A[largest];
    A[largest]=z;
    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;
}