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

int main (void)
{
    unsigned int n;
    std::ifstream input("algsort.in");
    input >> n;
    std::vector<signed int> v(n);
    std::vector<signed int>::iterator it(v.begin()), limit(v.end());
    do
    {
        input >> *it;
        ++it;
    }
    while (it < limit);
    input.close();
    it = v.begin();
    std::make_heap(it,limit);
    std::sort_heap(it,limit);
    --limit;
    std::ofstream output("algsort.out");
    while (true)
    {
        output << *it;
        if (it == limit)
            break;
        output.put(' ');
        ++it;
    }
    output.put('\n');
    output.close();
    return 0;
}