#include <stdio.h>

#define H 500000

int parent(int);
int left(int);
int right(int);
void maxHeapify(int *, int);
void buildMaxHeap(int *);

int h;

int main()
{

  int i;
  int A[H];


  scanf("%d", &h);

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

  buildMaxHeap(A);

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

  printf("\n");

  return 0;
}

int left(int i){

  return 2 * i;
  
}

int right(int i){

  return 2 * i + 1;

}

void maxHeapify(int *A, int i){

  int l, r, tmp, largest;

  l = left(i);
  r = right(i);

  if((l <= h) && (A[l] > A[i]))
    largest = l;
  else largest = i;

  if((r <= h) && (A[r] > A[largest]))
    largest = r;

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

}

void buildMaxHeap(int *A){

  int i, x;

  x = h / 2;

  for(i=x; i>=1; i--){
    maxHeapify(A, i);
  }

}