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

using namespace std;

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

int N;
vector< int > V;

int main()
{
    fin >> N;
    int k;
    for(int i = 0; i < N; i++) {
        fin >> k;
        V.push_back(k);
    }

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

    for(int i = 0; i < N; i++)
        fout << V[i] << " ";

}