#include<stdio.h>
 
#define N 500001
 
int h,i,A[N];
 
void maxHeapify(int);
void buildMaxHeap(void);
 
int left(int);
int right(int);
int main()
{
 
  scanf("%d",&h);
 
  for(i=1;i<=h;i++){
 
    scanf("%d",&A[i]);
 
  }
 
  buildMaxHeap();
 
  for(i=1;i<=h;i++){
 
    printf(" %d",A[i]);
 
  }
 
  printf("\n");
 
  return 0;
}
int left(int i)
{
  return 2*i;
}
 
int right(int i)
{
  return 2*i+1;
}
 
void maxHeapify(int i){
  int l,r,largest,tmp;
 
  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){
 
    tmp=A[i];
    A[i]=A[largest];
    A[largest]=tmp;
 
    maxHeapify(largest);
  }
}
 
void buildMaxHeap(void){
  for(i=h/2;i>=1;i--){
    maxHeapify(i);
  }
}