#include<stdio.h>
#define N 500000

int A[N], n;

void maxHeapify(int i){
  int a, l, r, largest;
  
  l = left(i);
  r = right(i);
  if(l <= n && A[l] > A[i]){
    largest = l;
  }
  else{ 
    largest = i;
  }
  if(r <= n && A[r] > A[largest]){
    largest = r;
  }
  if(largest != i){
    a = A[largest];
    A[largest] = A[i];
    A[i] = a;
    maxHeapify(largest);
  }
}

void buildMaxHeap(){
  int i;
  for(i = n/2 ; i >= 1 ; i--){
    maxHeapify(i);
  }
}
	      
int left(int i){
  return 2*i;
}

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

int main(){
  int i;

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

  return 0;
}