#include<stdio.h>
#define N 500000
int A[N],n;

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

    if(l <= n && A[l] > A[i] ){
        largest = l;
    }
    else{
        largest = i;
    }

    if(r <= n && A[r] > A[largest]){
        largest = r;
    }

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

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

int main(){
    int i;

    scanf("%d",&n);
    for(i=1;i<=n;i++){
        scanf("%d",&A[i]);
    }
    for(i=n/2; i>0;i--){
         maxHeapify(i);
    }
    for(i=1;i<=n;i++){
        printf("% d",A[i]);
    }
    printf("\n");
    return 0;
}
