// Heapsort: O(log n)
# include <fstream>
# include <vector>
# include <algorithm>

using namespace std;

ifstream fin("algsort.in");
ofstream fout("algsort.out");

vector<int> v;
vector<int>::iterator it;
int n, x;

int main() {
    fin >> n;
    for (int i=0; i<n; ++i) {
        fin >> x;
        v.push_back(x);
    }

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

    for (it = v.begin(); it != v.end(); ++it)
        fout << *it << " ";

    fin.close();
    fout.close();
    return 0;
}