#include<stdio.h>
#define H 250

int n,A[H+1];

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

void maxHeapify(int i){
  int l,r,x,largest;
  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){
    x=A[i];
    A[i]=A[largest];
    A[largest]=x;
    maxHeapify(largest);
  }
}
void buildMaxHeap(){
  int i;
  for(i=n/2;i>=1;i--)
    maxHeapify(i);
}  
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;
}