#include<cstdio>
#include<algorithm>
using namespace std;
const int N=500005;
int n,a[N];
void read()
{
  freopen("algsort.in","r",stdin);
  freopen("algsort.out","w",stdout);
  scanf("%d",&n);
  for(int i=1;i<=n;i++)
    scanf("%d",&a[i]);
}
void init()
{
  for(int i=n/2;i>=1;i--)
  {
    int p=i;
    if(a[2*i]>a[p])
      p=2*i;
    if(a[2*i+1]>a[p])
      p=2*i+1;
    if(p!=i)
      swap(a[i],a[p]);
  }
}
void scuf(int nod,int max)
{
  int p=nod;
  if(2*nod<=max && a[2*nod]>a[p])
    p=2*nod;
  if(2*nod+1<=max && a[2*nod+1]>a[p])
    p=2*nod+1;
  if(p!=nod)
  {
    swap(a[nod],a[p]);
    scuf(p,max);
  }
}
void solve()
{
  for(int i=n;i>=1;i--)
  {
    swap(a[1],a[i]);
    scuf(1,i-1);
  }
}
void afis()
{
  for(int i=1;i<=n;i++)
    printf("%d ",a[i]);
}
int main()
{
  read();
  init();
  solve();
  afis();
  return 0;
}