#include<stdio.h>
int A[500000],n;

void maxHeapify(int);
void buildMaxHeap(void);
int main(){
  int i;

  scanf("%d",&n);
  for(i=1;i<=n;i++)scanf("%d",&A[i]);
  buildMaxHeap();
  for(i=1;i<=n;i++)printf(" %d",A[i]);
  printf("\n");
  return 0;
}
void maxHeapify(int i){
  int l,r,H,largest;
  l=i*2;
  r=i*2+1;

  if(l<=n&&A[l]>A[i])
    largest=l;
  else
    largest=i;
  if(r<=n&&A[r]>A[largest])
    largest=r;
  if(largest!=i){
    H=A[i];
    A[i]=A[largest];
    A[largest]=H;
    maxHeapify(largest);
  }
}
void buildMaxHeap(){
  int i;
  for(i=n/2;i>0;i--){
    maxHeapify(i);
  }
}

