#include<stdio.h>
#include<stdlib.h>
#include<math.h>
#include<string.h>
#include<iostream>
#define inf 0x3f3f3f
using namespace std;
int heapsize,n,a[100];
int left(int p)
{
return 2*p;
}
int right(int p)
{
return 2*p+1;
}
void heapify(int a[10000],int s)
{
int l,r,ex,lagest;
l = left(s);
r = right(s);
if(l <= heapsize && a[l] > a[s])
lagest = l;
else
lagest = s;
if(r <= heapsize && a[r] > a[lagest])
lagest = r;
if(lagest != s)
{
ex = a[s];
a[s] = a[lagest];
a[lagest] = ex;
heapify(a,lagest);
}
}
void build()
{
heapsize = n;
for(int i = n/2 ;i >= 1 ;i--)
heapify(a,i);
}
int main()
{
int chg;
while(scanf("%d",&n) != EOF)
{
for(int i = 1 ;i <= n ;i++)
scanf("%d",&a[i]);
build();
for(int i = n ; i >= 2 ;i--)
{
chg = a[i];
a[i] = a[1];
a[1] = chg;
heapsize--;
heapify(a,1);
}
for(int i = 1 ;i <= n ;i++)
{
printf("%d ",a[i]);
}
}
return 0;
}
#include<stdlib.h>
#include<math.h>
#include<string.h>
#include<iostream>
#define inf 0x3f3f3f
using namespace std;
int heapsize,n,a[100];
int left(int p)
{
return 2*p;
}
int right(int p)
{
return 2*p+1;
}
void heapify(int a[10000],int s)
{
int l,r,ex,lagest;
l = left(s);
r = right(s);
if(l <= heapsize && a[l] > a[s])
lagest = l;
else
lagest = s;
if(r <= heapsize && a[r] > a[lagest])
lagest = r;
if(lagest != s)
{
ex = a[s];
a[s] = a[lagest];
a[lagest] = ex;
heapify(a,lagest);
}
}
void build()
{
heapsize = n;
for(int i = n/2 ;i >= 1 ;i--)
heapify(a,i);
}
int main()
{
int chg;
while(scanf("%d",&n) != EOF)
{
for(int i = 1 ;i <= n ;i++)
scanf("%d",&a[i]);
build();
for(int i = n ; i >= 2 ;i--)
{
chg = a[i];
a[i] = a[1];
a[1] = chg;
heapsize--;
heapify(a,1);
}
for(int i = 1 ;i <= n ;i++)
{
printf("%d ",a[i]);
}
}
return 0;
}