#include <fstream>
#include <queue>

using namespace std;

int main()
{
    ifstream fin("algsort.in");
    ofstream fout("algsort.out");
    int n;
    int i, temp;
    fin >> n;
    priority_queue<int, vector<int>, greater<int> > heap;
    for(i=0; i<n; i++)
    {
        fin >> temp;
        heap.push(temp);
    }
    fin.close();

    while(heap.empty() == 0)
    {
        fout << heap.top() << " ";
        heap.pop();
    }
    fout.close();
    return 0;
}