#include <iostream>
#include <fstream>

using namespace std;

#define Nmax 500002

int v[Nmax], n;

void ShellSort( int *a, int n )
{
    int h, i, j, k;

    for ( h = n; h; h >>= 1 )
            for ( i = h; i <= n; i++ )
            {
                k = a[i];

                for ( j = i; j >= h && k < a[j - h]; j -= h )
                    a[j] = a[j - h];

                a[j] = k;
            }
}

void ShellSort1( int *a, int n )
{
    for ( int increment = n >> 1; increment > 0; increment >>= 1 )
            for ( int i = increment; i <= n; i++ )
            {
                int temp = a[i];
                int j;

                for ( j = i; j >= increment; j -= increment )
                {
                    if ( temp < a[j - increment] )
                            a[j] = a[j - increment];
                    else
                            break;
                }

                a[j] = temp;
            }
}

void RadixSort( int *a, int n )
{
    int b[Nmax], bucket[10], m, exp = 1;

    for ( int i = 1; i <= n; i++ )
            if ( a[i] > m )
                m = a[i];

    while( m / exp > 0 )
    {
        for ( int i = 0; i <= 9; i++ )
                bucket[i] = 0;

        for ( int i = 1; i <= n; i++ )
                bucket[(a[i]/exp)%10]++;

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

        for ( int i = n; i >= 1; i-- )
                b[--bucket[(a[i]/exp)%10]] = a[i];

        for ( int i = 1; i <= n; i++ )
                a[i] = b[i];

        exp *= 10;
    }
}

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

    f >> n;

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

    RadixSort( v, n );

    for ( int i = 1; i <= n; i++ )
            g << v[i] << " ";

    return 0;
}