#include <stdio.h>
#include <stdlib.h>
#define H 500000

int n;
int A[H+1];

void maxHeapify(int);
void buildMaxHeap();

int main(){
  int i;
  
  scanf("%d",&n);
  for(i=1;i<=n;i++){
    scanf("%d",&A[i]);
  }
  buildMaxHeap();
    
    for(i=1;i<=n;i++){
    if(i == n){
      printf(" %d\n",A[i]);
    }
    else printf(" %d",A[i]);
    }

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

void buildMaxHeap(){
  int i;
  for(i = n/2;i >= 1;i--){
    maxHeapify(i);
  }
}
  
  

