#include<stdio.h>
#define N 5000000

int H,A[N];

void buildMaxHeap(int *);
void maxHeapify(int *,int);

int left(int);
int right(int);

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

  buildMaxHeap(A);

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

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


void maxHeapify(int *A, int i){
  int l,r,largest,ex;

  l = left(i);
  r = right(i);

  if( l <= H && A[l]>A[i] ) largest = l;
  else largest = i;
  if(r <= H && A[r] > A[largest])largest = r;

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

int left(int i){
  return 2*i;
}
int right(int i){
  return (2*i+1);
}