#include <algorithm>
#include <iostream>
#include <functional>
#include <vector>

using namespace std;

int input()
{
    int x;
    cin >> x;
    return x;
}

int main()
{
    vector<int> v(input());
    generate(v.begin(), v.end(), input);
    while (v.size() != 0) {
        make_heap(v.begin(), v.end(), greater<int>());
        cout << v.front() << endl;
        *v.begin() = v.back();
        v.pop_back();
    }
    return 0;
}