#include <stdio.h>

#define H 500000

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

int n;

int main(){

 int i;
 int p;
 int l;
 int r;
 int A[H];

 scanf("%d",&n);

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

 buildMaxHeap(A);

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

 printf("\n");

 return 0;
}

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

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

void maxHeapify(int *A,int i){

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

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