#include<stdio.h>
#define MAX 2000000
int H,A[MAX+1];
int parent(int i){
  return i/2;
}
int left(int i){
  return 2*i;
}
int right(int i){
  return 2*i+1;
}

void maxHeapity(int A[],int i){
  int l,r,large,t;
  l=left(i);
  r=right(i);
  if(l<=H&&A[l]>A[i])large=l;
  else large=i;
  if(r<=H&&A[r]>A[large])large=r;
  if(large!=i){
    t=A[i];
    A[i]=A[large];
    A[large]=t;
    maxHeapity(A,large);
  }
}

int main(){
  int i;
  scanf("%d",&H);
  for(i=1;i<=H;i++){
    scanf("%d",&A[i]);
  }

  for(i=H/2;i>=1;i--){
    maxHeapity(A,i);
  }

  for(i=1;i<=H;i++){
   
    printf("%d",A[i]);
    if(i==H)break;
    printf(" ");
  }
  printf("\n");

  return 0;
}

