#include <algorithm>
#include <fstream>
#include <queue>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int n,i,x;
int main()
{
    priority_queue <int, vector<int>, greater<int> > h;
    f>>n;
    for(i=1;i<=n;++i) f>>x,h.push(x);
    for(i=1;i<=n;++i)
    {
        g<<h.top()<<" ";
        h.pop();
    }
    return 0;
}