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

using namespace std;

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

int N, X;

vector <int> arr;

int main() {
    fin >> N;

    for (int i = 1; i <= N; i++) {
        fin >> X;
        arr.push_back(X);
    }

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

    for (int i = 1; i <= N; i++)
        fout << arr[i - 1] << " ";
}