#include <stdio.h>

#define H 500000

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

int n,A[H+1];

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

  l = left(i);
  r = right(i);
  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);
  }
}

int main(){

  int i,j;

  scanf("%d",&n);

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

  for(j=n/2;j>=1;j--) maxHeapify(j);

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

  printf("\n");
  return 0;
}
