#include <stdio.h>
#define N 20000000
void maxHeap(int);
void buildHeap(void);
int left(int);
int right(int);

int A[N],B[N],n;

int main(){
  int i;

  scanf("%d",&n);

  for(i=1;i<=n;i++){
    scanf("%d",&A[i]);
  }

  buildHeap();
  
  for(i=1;i<=n;i++)
    printf(" %d",A[i]);
  printf("\n");
  return 0;
}

void buildHeap(){
  int i;

  for(i=n/2;i>=1;i--){
    maxHeap(i);
  }
}

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

}


int left(int i){
  return 2*i;
}

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