#include<stdio.h>

void maxHeapify(int);
void buildMaxHeap();

int n;
int A[500000];

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

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

void maxHeapify(int i){
  int l,r;
  int largest;
  int tmp;
  l =2*i;
  r =2*i+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(largest);
  }
}


void buildMaxHeap(){
  int i;
  for(i=n/2;i>=1;i--)maxHeapify(i);
}

