#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
vector <int> heap;
int n,i,x,Dim;
inline void Rec(int i)
{
	int l=i<<1;
	int r=(i<<1)+1;
	int Max=i;
	if(l<=Dim&&heap[l]>heap[i])
		Max=l;
	if(r<=Dim&&heap[r]>heap[Max])
		Max=r;
	if(i!=Max)
	{
		swap(heap[i],heap[Max]);
		Rec(Max);
	}
}
void Build()
{
	for(int i=n/2;i;i--)
		Rec(i);
}
void HeapSort()
{
	Build();
	for(int i=n;i>1;i--)
	{
		swap(heap[i],heap[1]);
		Dim--;Rec(1);
	}
}
int main()
{
	freopen("algsort.in","r",stdin);
	freopen("algsort.out","w",stdout);
	scanf("%d",&n);
	heap.resize(n+2);Dim=n;
	for(i=1;i<=n;i++)
	{
		scanf("%d",&heap[i]);
	}
	HeapSort();
	for(i=1;i<=n;i++)
		printf("%d ",heap[i]);
	printf("\n");
	return 0;
}