#include <stdio.h>
#define H 500001

int n;

int maxHeapify(int A[], int i){
    int l, r, largest, temp;
    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(A, largest);
    }
    
}

int buildMaxHeap(int A[]){
    int i;
    for(i=n/2; i>0; i--)    maxHeapify(A, i);
}

int main(){
    int i, A[H];
    scanf("%d",&n);
    for(i=0; i<n; i++)  scanf("%d",&A[i+1]);
    
    buildMaxHeap(A);
    
    for(i=0; i<n; i++)
    printf(" %d",A[i+1]);
    printf("\n");
    
    return 0;
}
