#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
long int n,x;
vector<int>V;
int main()
{freopen("algsort.in","r",stdin);
freopen("algsort.out","w",stdout);
scanf("%ld",&n);
for(int i=1;i<=n;i++)
    {
        scanf("%ld",&x);
        V.push_back(x);
    }
make_heap(V.begin(),V.end());
sort_heap(V.begin(),V.end());

for(int i=0;i<n;i++) printf("%ld ",V[i]);
return 0;
}