#include <stdio.h>

int A[500001],H;
void maxHeapify(int *A,int i){
  int largest,l,r,tmp;
  l = 2*i;
  if(2*i+1 <= H)r = 2*i+1;
  else r = NULL;
  if(l <= H && A[l] > A[i])largest = l;
  else largest = i;
  if(r <= H && A[r] > A[largest] && r != NULL)largest = r;

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

int main(){
  int i;
  scanf("%d",&H);
  for(i=1;i<=H;i++){
    scanf("%d",&A[i]);
  }
  for(i = H/2;i > 0;i--){
    maxHeapify(A,i);
  }

  
  for(i=1;i<=H;i++){
    printf(" %d",A[i]);
  }
  printf("\n");

  return 0;
}

