#include<stdio.h>

#define H 500000

int 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 *A,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(A,largest);
  }

  return;
}

void buildMaxHeap(int *A){
  int i;

  for(i=n/2;i>0;i--){
    maxHeapify(A,i);
  }

  return;
}

int main(){
  int i,A[H];

  scanf("%d",&n);

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

  buildMaxHeap(A);

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

  printf("\n");

  return 0;
}		      
  
			

