#include<stdio.h>
#include<stdlib.h>

int *A, H;

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 = left(i);
  int r = right(i);
  int largest, temp;

  if(l<=H && A[l]>A[i]){
    largest = l;
  }
  else {
    largest = i;
  }

  if(r<=H && A[r]>A[largest]){
    largest = r;
  }

  if(largest != i){
    temp = A[i];
    A[i] = A[largest];
    A[largest] = temp;
    maxHeapify(largest);
  }
}

int main(){
  int i;

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

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

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

  return 0;
}

