#include<stdio.h>

void maxHeapify(int);
void buildMaxHeap(void);

int A[500000],n;

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

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


void maxHeapify(int i){
  int l,r,largest,p;
  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){
    p=A[i];
    A[i]=A[largest];
    A[largest]=p;
    maxHeapify(largest);
  }
}

