#include<cstdio>
#include<algorithm>
using namespace std;
#define BM 100005
int a[BM],b[BM],f[11];
int main (){
    int n,i,p,exp,cc;
    freopen("algsort.in","r",stdin);
    freopen("algsort.out","w",stdout);
    scanf("%d",&n);
    for(i=1;i<=n;++i)scanf("%d",&a[i]);
    for(p=1,exp=1;exp<=12;++exp,p*=10){
        for(i=0;i<=10;++i)f[i]=0;
        for(i=1;i<=n;++i){
            cc=(a[i]/p)%10;
            ++f[cc+1];
        }
        for(i=1;i<=10;++i)f[i]+=f[i-1];
        //for(i=1;i<=10;++i)printf("f[%d]=%d\n",i,f[i]);
        for(i=1;i<=n;++i){
            cc=(a[i]/p)%10;
            ++f[cc];
            b[f[cc]]=a[i];
        }
        for(i=1;i<=n;++i)swap(a[i],b[i]);
    }
    for(i=1;i<=n;++i)printf("%d ",a[i]);
    return 0;
}