#include <stdio.h>
#define N 2000000

int A[N+1], n;

int parent(int i){
  return i/2;
}

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

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

void maxHeapify(int i){

  int l, r, largest, temp;

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

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;
}