#include<stdio.h>
#define MAX 500000
int A[MAX];
int B[MAX]; 
int n;
void maxHeapify(int i){
  int l,r,largest;
  l=2*i;
  r=2*i+1;
 
  if(l<=n && A[l] > A[i])largest = l;
  else largest = i;
  if(r<=n && A[r]>A[largest])largest = r;

  if(largest != i){
    B[i]=A[i];
    A[i]=A[largest];
    A[largest]=B[i];
    
    maxHeapify(largest);
  }}

int main(){
  int i;
  scanf("%d", &n);
  
  for(i=1;i<n+1;i++){scanf("%d", &A[i]);}
  for(i=n/2;i>=1;i--){maxHeapify(i);}

  for(i=1;i<n+1;i++){if(i!=n)printf(" %d", A[i]);
    else printf(" %d\n", A[i]);}
  
  return 0;
}

