#include<stdio.h>
#define MAX 2000000
int H,A[MAX+1];
void swap(int i,int j,int n,int n2){
    A[n]=j;
    A[n2]=i;
}
void maxHeapify(int i){
    int l,r,largest;
    l=2*i;
    r=2*i+1;
    
    if(l<=H && A[l]>A[i])largest=l;
    else largest=i;
    if(l<=H && A[r]>A[largest])largest=r;
    
    if(largest!=i){
        swap(A[i],A[largest],i,largest);
        maxHeapify(largest);
    }
}
int main(){
    int i,j;
    scanf("%d",&H);
    for(i=1;i<=H;i++){
        scanf("%d",&A[i]);
    }
    for(i=H/2;i>=1;i--){
        maxHeapify(i);
    }
    for(i=1;i<=H;i++){
        printf(" %d",A[i]);
    }
    printf("\n");
    return 0;
}

