#include <stdio.h>

int H,A[500000];
void buildMaxHeap(void);
void maxHeapify(int);
int left(int);
int right(int);

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

  buildMaxHeap();

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

  return 0;
}


void buildMaxHeap(){
  int i,j;
  j = H/2;
  for(i=j;i!=0;i--){
    maxHeapify(i);
  }
}

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);
  }
}
    
int left(int i){
  int a;
  a = 2*i; 
  return a;
}

int right(int i){
  int b;
  b = 2*i+1;
  return b;
}

