#include <fstream>
#include <queue>
using namespace std;
ifstream fin("algsort.in");
ofstream fout("algsort.out");

int n, i, a;
priority_queue<int,  vector<int> , greater<int> > h;

int main()
{
    fin>>n;
    for(i=1;i<=n;i++)
    {
        fin>>a;
        h.push(a);
    }
    for(i=1;i<=n;i++)
    {
        fout<<h.top()<<" ";
        h.pop();
    }
    return 0;
}