#include<stdio.h>

int A[500001];
int H;

void maxHeapify(int i)
{
  int l, r, largest, max;
  l = i*2;
  r = i*2+1;

  if(l<=H && A[l]>A[i])
    largest = l;
  else
    largest = i;
  if(r<=H && A[r]>A[largest])
    largest = r;

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

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


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

  buildMaxHeap();

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

  return 0;
}