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


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

unsigned int *A;
int num;
int main(){

  int i;

  scanf("%d", &num);
  
  A = malloc(sizeof(int)*num+1);

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

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

void maxHeapify(int* A, int i){
  int l, r, largest, temp;

  l = 2*i;
  r = 2*i+1;

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

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

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

void buildMaxHeap(int *A){
  int i;
  
  for(i = num/2; i > 0; i--){
    maxHeapify(A, i);
  }
}

