#include <fstream>
using namespace std;

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


int getMax(int arr[], int n)
{
    int mx = arr[0];
    for (int i = 1; i < n; i++)
        if (arr[i] > mx)
            mx = arr[i];
    return mx;
}

void countSort(int arr[], int n, int exp)
{

    int output[n];
    int i, coun[10] = { 0 };

    for (i = 0; i < n; i++)
        coun[(arr[i] / exp) % 10]++;

    for (i = 1; i < 10; i++)
        coun[i] += coun[i - 1];

    for (i = n - 1; i >= 0; i--) {
        output[coun[(arr[i] / exp) % 10] - 1] = arr[i];
        coun[(arr[i] / exp) % 10]--;
    }

    for (i = 0; i < n; i++)
        arr[i] = output[i];
}

void radixsort(int arr[], int n)
{
    int m = getMax(arr, n);

    for (int exp = 1; m / exp > 0; exp *= 10)
        countSort(arr, n, exp);
}


int main()
{
    int n;
    fin >> n;

    int arr[n+1];
    for(int i=0; i<n; ++i)
        fin >> arr[i];

    radixsort(arr, n);

    for (int i = 0; i < n; i++)
        fout << arr[i] << " ";
}