#include <stdio.h>
#define N 500001

int h,A[N];

int parent(int i){
  return i/2;
}
int left(int i){
  return 2*i;
}
int right(int i){
  return 2*i+1;
}

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);
  }
}

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;
}

