#include <iostream>
#include <fstream>
using namespace std;

int main()
{
    ifstream fin("algsort.in");
    ofstream fout("algsort.out");

    int n, i, j, aux, v[500000];
    fin >> n;
    for (i = 0; i < n; i++)
        fin >> v[i];

    int maxim = v[0];
    int minim = v[0];

    for (i = 0; i < n; i++)
    {
        if (v[i] > maxim)
            maxim = v[i];
        if (v[i] < minim)
            minim = v[i];
    }

    int fr[maxim];
    for (i = minim; i <= maxim; i++)
        fr[i] = 0;

    for (i = 0; i < n; i++)
        fr[v[i]] ++;

    for (i = minim; i <= maxim; i++)
        for (j = 0; j < fr[i]; j++)
            fout << i << ' ';

    fin.close();
    fout.close();

    return 0;
}