#include<iostream>
#include<fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
int n,i,m;
long v[500001];
void countsort(int n,int exp)
{
    int b[n];
    int a[10]={0};
    for(i=0;i<n;i++)
        a[(v[i]/exp)%10]++;
    for(i=1;i<10;i++)
        a[i]+=a[i-1];
    for (i=n-1;i>=0;i--)
    {
        b[a[(v[i]/exp)%10]-1]=v[i];
        a[(v[i]/exp)%10]--;
    }
    for(i=0;i<n;i++)
        v[i]=b[i];
}

void radix(int n)
{
    m=v[0];
    for(i=1;i<=n;i++)
        if(v[i]>m) m=v[i];
    for (int exp=1;m/exp>0;exp*=10)
        countsort(n,exp);
}

int main()
{
    f>>n;
    for(i=0;i<n;i++)
        f>>v[i];
    radix(n);
    for(i=0;i<n;i++)
        g<<v[i]<<" ";
    return 0;
}