#include<stdio.h>

int H,A[5000001];

void buildMaxHeap(int *);
void maxHeapify(int *,int);
int left(int);
int right(int);
main()
{
  int i;
  scanf("%d",&H);
  for(i=1;i<H+1;i++)/*?????????1?§???????*/
    {
      scanf("%d",&A[i]);
    }
  buildMaxHeap(A);
  for(i=1;i<H+1;i++)
    {
      printf(" %d",A[i]);
    }
  printf("\n");
  return 0;
}

void buildMaxHeap(int* A)
{
  int i;
  /*H = A.length;*/

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

}

void maxHeapify(int* A,int i)
{
  int l,r,largest,imm;
  
  l = left(i);
  r = right(i);
  if(l <= H && A[l] > A[i])largest = l;
  else largest = i;
  if(r <= H && A[r] > A[largest]) largest = r;

  if(largest != i)
    {
      imm = A[i];
      A[i] = A[largest];
      A[largest] = imm;
      maxHeapify(A,largest);/*?????°*/
    }

}


int left(int i)
{
  return 2*i;
}

int right(int i)
{
  return (2*i+1);
}