#include<stdio.h>

int A[500001];
int H;

void buildMaxHeap();
void maxHeapify(int*, int);

int main(){

int n,i;
  
  scanf("%d",&H);

  for(i=1; i<=H; i++)
    scanf("%d",&A[i]);
  un
  buildMaxHeap();
    
  for(i=1; i<=H; i++)
    printf(" %d",A[i]);

  printf("\n");

  return 0;
}

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

void maxHeapify(int *A, int i){
  int l,r,N,largest;
  
  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){
    N = A[i];
    A[i] = A[largest];
    A[largest] = N;  
    maxHeapify(A,largest);
  }
}