#include <stdio.h>

#define MAX 500001

void swap(int [],int,int);
int left(int);
int right(int);
int parent(int);
void maxHeapify(int [],int,int);
void buildMaxHeap(int [],int);

int main(){
  int A[MAX],n;
  int i;
  
  scanf("%d",&n);

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

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

  printf("\n");
  
  return 0;
}

void swap(int A[],int a,int b){
  int temp;

  temp = A[a];
  A[a] = A[b];
  A[b] = temp;
}

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

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

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

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

void buildMaxHeap(int A[],int n){
  int i;

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

