#include<stdio.h>


int A[500000];
int n;

void maxHeapify(int);

int main(){

  int i;

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

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

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


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

  l = 2*i;
  if(l<=n&&A[l]>A[i])
    largest = l;
  else largest = i;
  
  if(n>2*i){
    r = 2*i+1;
    if(A[r]>A[largest])largest = r;
  }

  if(largest != i){
    tmp = A[i];
    A[i] = A[largest];
    A[largest] = tmp;
    maxHeapify(largest);
  }

  
}

  