#include <stdio.h>
#define N 500000

int A[N],H;

void swap(int *a, int *b){
  int tmp;
  tmp=*a;
  *a=*b;
  *b=tmp;
}

void maxHeapify(int *A, 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){
    swap(&A[i],&A[largest]);
    maxHeapify(A,largest);
  }
}

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

int main(){
  int i;
  A[0]=0;
  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;
}

