#include<stdio.h>

#define Max 2000000

int h, A[Max + 1];

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

    maxHeapify(largest);
  }
}


int main(){
  int i;
  
  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;
}
