#include <iostream>
#include <fstream>
#include <queue>
#include <functional>

using namespace std;

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

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

int main()
{
    int n, x;

    for (in >> n; n; --n) {

        in >> x;
        heap.push(x);
    }
    in.close();

    while (!heap.empty()) {

        out << heap.top() << " ";
        heap.pop();
    }
    out << "\n";
    out.close();
    return 0;
}