#include<stdio.h>

int A[500000];

void maxHeapify(int i,int H)
{
  int l,r,largest,x = 0;

  l = 2 * i;
  r = 2 * i + 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)
    {
      x = A[i];
      A[i] = A[largest];
      A[largest] = x;
      maxHeapify(largest,H);
    }
}

int main()
{
  int H,i = 0;

  scanf("%d",&H);

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

  for(i = H / 2;i >= 1;i--){
    maxHeapify(i,H);
  }

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

  return 0;
}

