#include <stdio.h>

int A[500001],H;

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

    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(A, largest);
    }
}

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



int main(){
    int i,p,l,r;

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