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

int left(int i){
  return 2*i;
}
int right(int i){
  return 2*i+1;
}
void maxHeapify(int i){
  int l=left(i);
  int r=right(i);
  int largest,tmp;
  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);
  }
}

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

  for(i=H/2;i>=1;i--)maxHeapify(i);

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

  return 0;
}

