#include <stdio.h>

int a[500001],n;

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

  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){
    k=a[i];
    a[i]=a[largest];
    a[largest]=k;
    maxHeapify(largest);
  }
}

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

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

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

  return 0;
}

