#include <fstream>
#include <queue>
using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");
priority_queue <int,vector<int>,greater<int> > a;

int main()
{
    int i,x,n;
    in>>n;
    for(i=0;i<n;i++)
    {
        in>>x;
        a.push(x);
    }
    while(!a.empty())
    {
        out<<a.top()<<' ';
        a.pop();
    }
    in.close();out.close();
    return 0;
}