#include <stdio.h>

#define MAX_H 500000
int H;

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


void MaxHeapif(int A[], 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;
		MaxHeapif(A, largest);
	}
}

void buildMaxHeap(int A[]) {
	int i;
	for (i = H/2; i > 0; --i) {
		MaxHeapif(A, i);
	}
	return;
}

int main(void) {
	int i, A[MAX_H+1] = {0};
	
	scanf("%d", &H);
	for (i = 1; i <= H; ++i) {
		scanf(" %d", &A[i]);
	}

	buildMaxHeap(A);
	
	for (i = 1; i <= H; ++i) {
		printf(" %d", A[i]);
	}
	putchar('\n');
	/* for (i = 1 ; i <= H; i++) { */
	/* 	printf("node %d: key = %d, ", i, A[i]); */
	/* 	if (parent(i) >= 1) printf("parent key = %d, ", A[parent(i)]); */
	/* 	if (left(i) <= H) printf("left key = %d, ", A[left(i)]); */
	/* 	if (right(i) <= H) printf("right key = %d, ", A[right(i)); */
	/* 	printf("\n"); */
	/* } */
	
	return 0;
}