#include <stdio.h>
#define N 500001

int A[N],H;

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,tmp;
  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){
    tmp = A[i];
    A[i] = A[largest];
    A[largest] = tmp;
    maxHeapify(largest);
  }
}
void buil_max_h(void){
  for(int i = H/2; i >= 1; i--) maxHeapify(i);
}

int main(){
  int i,n;
  scanf("%d",&H);
  for(i = 1; i <= H; i++){
    scanf("%d",&A[i]);
  }
  buil_max_h();
  for(i = 1; i <= H; i++){
    printf(" %d",A[i]);
  }
  printf("\n");
  return 0;
}

