#include<stdio.h>
#define MAX 2000000
#define left(i) 2*i
#define right(i) 2*i+1
int A[MAX+1],H;

void maxHeapify(int i){
  int tmp,largest,l,r;
  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[largest];
    A[largest] = A[i];
    A[i] = 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;
}