#include <stdio.h>

#define N 500000
#define Nil -1

int n;
void maxheapify(int);
int A[N];

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("\n");

  return 0;
}

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

  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){
    tmp = A[i];
    A[i] = A[largest];
    A[largest] = tmp;
    maxheapify(largest);
  }

}