#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;

int main(){
    ifstream f("algsort.in");
    ofstream g("algsort.out");
    int n, x;
    f>>n;
    vector<int> v;
    while(f>>x)v.push_back(x);
    //sort(v.begin(), v.end());

    make_heap(v.begin(), v.end());
    sort_heap(v.begin(), v.end());

    vector<int>::iterator it;
    it=v.begin();
    while(it!=v.end())
        g<<*it++<<" ";


    return 0;
}