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

#define MAX 500001

int A[MAX];
int H;

int left(int i){
  return 2*i;
};

int right(int i){
  return 2*i+1;
};

int parent(int i){
  return 2/i;
};

void print(){
  int i;

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

void maxHeapify(int i){
  int l,r,largest;
  int v;

  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){
    v = A[i];
    A[i] = A[largest];
    A[largest] = v;
    maxHeapify(largest);
  }
  
}
int main(){
  int i;

  scanf("%d",&H);

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

  for(i = H/2; i >= 1; i--)maxHeapify(i);
  
  print();
  
  return 0;
}

