#include<cstdio>
#include<deque>

using namespace std;

deque<int> b[10];
int i,n,k,l,o,p,nr,j,maxx,x,a[500000];

int main()
{
    freopen("algsort.in","r",stdin);
    freopen("algsort.out","w",stdout);
    scanf("%d",&n);

    for(i=1; i<=n; i++)

        scanf("%d",&a[i]);



    l=1;
    do
    {
        for(p=1; p<=n; p++)
            b[a[p]/l%10].push_back(a[p]);
    k=0;
        for(p=0; p<=9; p++)
            for(o=0; o<b[p].size(); o++)a[++k]=b[p][o];
       for(p=0;p<=9;p++) b[p].clear();

        l=l*10;
    }while(l<=1000000010);
    for(i=1; i<=n; i++)printf("%d ",a[i]);
    return 0;
}