#include<stdio.h>

int H;

void maxHeapify(int *A,int i){
  int largest,ch,l,r;
  l = 2*i;
  r = 2*i+1;

  if(l <= H && A[l] > A[i]) largest = l;
  else largest = i;

  if(r <= H && A[r] > A[largest]) largest = r;

  if(largest != i){
    ch = A[i];
    A[i] = A[largest];
    A[largest] = ch;
    maxHeapify(A,largest);
  }
}

void buildMaxHeap(int *A){
  int i;
  for(i = H/2;i >= 1; i--) maxHeapify(A,i);
}

int main(){
  int A[500000];
  int i;

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

  buildMaxHeap(A);

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

