#include <fstream>
#include <queue>

using namespace std;

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

int N, X;

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

int main()
{
    f.tie(NULL);

    f >> N;

    for(int i = 1; i <= N; ++i)
    {
        f  >> X;

        H.push(X);
    }

    while(N--)
    {
        g << H.top() << ' ';

        H.pop();
    }

    g << '\n';

    return 0;
}