#include <stdio.h>
#define MAX 500001

int A[MAX],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,kari;
  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){
    kari = A[i];
    A[i] = A[largest];
    A[largest] = kari;
    maxHeapify(largest);
  }
}

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

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;

}