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

using namespace std;

vector<int> v;

int main()
{
    ifstream f("algsort.in");
    ofstream g("algsort.out");
    int n, x; f >> n;
    for(int i = 1; i <= n; i ++) {
        f >> x; v.push_back(x);
    }
    make_heap(v.begin(), v.end());
    sort_heap(v.begin(), v.end());
    for(int i = 0; i < v.size(); i ++) g << v[i] << " ";
    g << "\n";
    return 0;
}