#include<stdio.h>
#define h 500000

int H,A[h+1];

int maxHeapify(int [],int);
int buildMaxHeap(int []);

int main(){
  int i;

  scanf("%d",&H);

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

  for(i=H/2;i>=1;i--){
    maxHeapify(A,i);
  }

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

int maxHeapify(int A[],int i){

  int l,r,x,largest;

  l = 2*i;
  r = 2*i+1;
  if(l <= H && A[l] > A[i])
    largest = l;
  
  else
    largest = i;
  
  if( r <= H && A[r] > A[largest])
    largest = r;
  
  if(largest != i){
    x=A[i];
    A[i]=A[largest];
    A[largest] = x;
    maxHeapify(A, largest);
  }
}

int buildMaxHeap(int A[]){
  int i;
  for(i=H/2;i>=1;i--)
    maxHeapify(A,i);
}

