#include <stdio.h>

#define N 10000
#define Nil -1

int n;
void maxheapify(int*, int);
void buildMaxHeap(int*);

void maxheapify(int* A, int i){
  int l,r,largest,tmp;

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

  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(A,largest);
  }
}

void buildMaxHeap(int* A){
  int i;

  for(i = n/2;i>=1;i--)
    maxHeapify(A,i);

}

int main(){
  int i;
  int T[N];

  scanf("%d",&n);
  for(i=1;i<=n;i++)
    scanf("%d", &T[i]);

  buildMaxHeap(T);

  for(i=1;i<=n;i++)
    printf(" %d", &T[i]);

  printf("\n");

  return 0;
}