#include<stdio.h>

int parent(int);
int left(int);
int right(int);
void maxHeapify(int *,int);
void buildMaxHeap(int *);

int H,A[500001];
int main(){
  int i,parentkey,leftkey,rightkey;
  scanf("%d",&H);
  for(i=1;i<=H;i++){
    scanf("%d",&A[i]);
  }
   buildMaxHeap(A);
  for(i=1;i<=H;i++){
    printf(" %d",A[i]);
    }
  printf("\n");
 return 0;
}
int parent(int i){
  return i/2;
}

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

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

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

