#include<stdio.h>
#define N 500000
void maxHeapify(int [],int);
 
int H;
int main(){
    int i;
    int A[N+1];
 
    scanf("%d",&H);
    for(i=1;i<=H;i++){
        scanf("%d",&A[i]);
    }
    for(i=H/2;i>=1;i--){
        maxHeapify(A,i);
    }
    for(i=1;i<=H;i++){
        printf(" %d",A[i]);
    }
    printf("\n");
 
    return 0;
}
void maxHeapify(int A[],int i){
    int l,r,largest,tmp;
 
    l = i*2;
    r = i*2+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){
        tmp = A[i];
        A[i] = A[largest];
        A[largest] = tmp;
        maxHeapify(A,largest);
    }
}

