#include<stdio.h>

#define H 500000

void maxHeapify(int*,int,int);
void buildMaxHeap(int*,int);

int main(void){
  int n,Node[H];
  int i;

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

  buildMaxHeap(Node,n);

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

void maxHeapify(int *A, int i, int n){
  int l,r,largest,tmp;
  l = 2*i;
  r = 2*i+1;
  
  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(A,largest,n);
  }
}

void buildMaxHeap(int *A, int n){
  int i;

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

