#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

int main()
{
    int n,i,x;
    vector <int> V;
    ifstream f("algsort.in");
    ofstream g("algsort.out");
    f>>n;
    for(i=0;i<n;++i)
    {
        f>>x;
        V.push_back(x);
    }
    make_heap( V.begin(), V.end() );
    sort_heap( V.begin(), V.end() );

    for(i=0;i<n;++i)
        g<<V[i]<<" ";
    f.close();
    g.close();
    return 0;
}