#include<stdio.h>
int n;
int A[500001];
void maxHeapify(int);
int main(){
  int parent(int);
  int left(int);
  int right(int);
  void buildMaxHeap();
  int i;
  
  scanf("%d",&n);
  for(i=1;i<=n;i++){
    scanf("%d",&A[i]);
  }

  buildMaxHeap();
  
  for(i=1;i<=n;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 buildMaxHeap(void){
  int i;
  for(i = n/2;i>=1;i--){
    maxHeapify(i);
  }
}

void maxHeapify(int i){
  int l = left(i);
  int r = right(i);
  int largest;
  int tmp;
  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(largest);
  }
}

