#include<stdio.h>
#define MAX 2000000

int H, A[MAX+1],a;

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(r <= H && A[r] > A[largest]){
    largest = r;
  }

  if(largest != i){
    a = A[i]; 
    A[i] = A[largest];        
    A[largest] = a;
    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++){
    if(i<H){
    printf("%d ",A[i]);
    }
    if(i==H){
      printf("%d",A[i]);
    }
  }
  printf("\n");
  return 0;
}