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

const int N = 500005;
int v[N], aux[N], n;

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

void count()
{
    int D = v[1];

    for (int i = 2 ; i <= n ; i++)
        if (D > v[i])
            D = v[i];

    for (int i = 1 ; i <= n ; i++)
        aux[v[i] - D]++;

    n = 0;

    for (int i = 0 ; i < N ; i++)
        while (aux[i]--)
            v[ ++n ] = i + D;
}

int main()
{
    in >> n;

    for (int i = 1 ; i <= n ; i++)
        in >> v[i];

    count();

    for (int i = 1 ; i <= n ; i++)
        out << v[i] << " ";
    out << "\n";
    return 0;
}