#include <stdio.h>

#define MAX 500001

int N;

void maxHeapify(int *A, int i) {
    int l, r, largest, tmp;
    
    l = i * 2;
    r = i * 2 + 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) {
        tmp = A[i];
        A[i] = A[largest];
        A[largest] = tmp;
        maxHeapify(A, largest);
    }
}

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

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

