#include<stdio.h>
#include<stdlib.h>

#define N 1000001
#define nil NULL

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

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

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

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

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

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