#include <stdio.h>
#define H 500000
 
int A[H],n; 

void maxHeapify(int *A,int i){

  int largest,l,r,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);
  }
}

void buildMaxHeap(int *A){

  int i;

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


int main(void){
 
  int k,p,l,r,i;

  scanf("%d",&n);
 
  for(i=1;i<=n;i++){
    scanf("%d",&A[i]);
  }
    buildMaxHeap(A);

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