#include<stdio.h>
#define H 500000

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

void maxHeapify(int);

int A[H];
int n;
int main(){

  int i,x;
  scanf("%d",&n);
  for(i=1;i<=n;i++){
    scanf("%d",&A[i]);
  }
  for(i=n/2;i>=1;i--){
    maxHeapify(i);
  }
 
  for(i=1;i<=n;i++){
    printf(" %d",A[i]);
  }
  printf("\n");
  return 0;
  
}



void maxHeapify(int i){
  int l,r,largest,tmp;

  l=left(i);
  r=right(i);

   if(l<=n && A[l]>A[i]){
    largest=l;
  }
  else {
    largest=i;
  }
  if(r<=n && A[r]>A[largest]){
    largest=r;
  }
 
  if(largest!=i){
    tmp=A[i];
    A[i]=A[largest];
    A[largest]=tmp;
    maxHeapify(largest);
  }
}