#include<stdio.h>
void maxHeapify(int *A,int i);
void buildMaxHeap(int *A);
int left(int i){
  return 2*i;
}
int right(int i){
  return 2*i+1;
}

int i,A[500005],n;
int main(){
  scanf("%d",&n);
  for(i=1;i<=n;i++){
    scanf("%d",&A[i]);
  }
  buildMaxHeap(A);
  for(i=1;i<=n;i++){
    printf(" %d",A[i]);
  }
  printf("\n");
  return 0;
}
void buildMaxHeap(int A[]){
  int i;
  for(i=n/2;i>=1;i--){
    maxHeapify(A,i);
  }
}
void maxHeapify(int A[],int i){
  int l,r,largest,tmp;
  l= left(i);
  r =right(i);
  if(l<=n && A[l]>A[i])largest =l;
  else largest =i;
  if(r<=n&&A[r]>A[largest])largest=r;
  if(largest != i){
    tmp=A[i];
    A[i]=A[largest];
    A[largest]=tmp;
    maxHeapify(A,largest);
  }
}

  