#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

vector <int> a;
int n;

void cit()
{
    int i,x;
    freopen("algsort.in","r",stdin);
    scanf("%d",&n);
    for(i=1;i<=n;i++)
    {
        scanf("%d",&x);
        a.push_back(x);
    }
}

void afis()
{
    int i;
    freopen("algsort.out","w",stdout);
    for(i=0;i<n;i++)
        printf("%d ",a[i]);
}

int main()
{
    cit();
    make_heap(a.begin(),a.end());
    sort_heap(a.begin(),a.end());
    afis();
    return 0;
}