#include<stdio.h>
#define N 500000

int A[N],H;

int left(int i){return i*2;}
int right(int i){return (i*2)+1;}


void trade(int i,int j)
{
  int rep;
  rep = A[i];
  A[i] = A[j];
  A[j] = rep;
}

void maxHeapify(int i){

  int l,r,largest;

  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){
    trade(i,largest);
    maxHeapify(largest);
  }
}

void buildMaxHeap(){
  int i;
  for(i=H/2;i>0;i--)
    maxHeapify(i);
}

int main(){
  int i;

  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;
}
