//heapsort
#include <iostream>
#include <queue>
#include <fstream>

using namespace std;

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

    int n, val;
    priority_queue<int, vector<int>, greater<int> > heap;

    fin >> n;

    for (int i = 0; i < n; i++) {
        fin >> val;
        heap.push(val);
    }

    while (!heap.empty()) {
        fout << heap.top() << " ";
        heap.pop();
    }

    fin.close();
    fout.close();

    return 0;
}