#include <stdio.h>
int left(int);
int right(int);
void maxHeapify(int);
void buildHeap();
int A[500000];
int H;
int main(){
	int i;
	scanf("%d",&H);
	for(i=1;i<=H;i++){
		scanf("%d",&A[i]);
	}
	buildHeap();
	for(i=1;i<=H;i++){
		printf(" %d",A[i]);
	}
	printf("\n");
	return 0;
}
int left(int key){
  return 2*key;
}

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

void maxHeapify(int i){
	int l,r,largest,tmp;
	l = left(i);
	r = right(i);
	if(l <= H && A[l] > A[i] ) largest = l;
	else largest = i;
	if(r <= H && A[r] > A[largest]) largest = r;
	if(largest != i){
		tmp = A[i];
		A[i] = A[largest];
		A[largest] = tmp;
		maxHeapify(largest);
	}
}

void buildHeap(){
	int i;
	for(i=H/2;i>=1;i--){
		maxHeapify(i);
	}
}