#include<fstream>
using namespace std;
ifstream f("algsort.in");
ofstream g("algsort.out");
long v[500001],i,j,exp=1,n,maxm=0,aux[500001];
void radix()
{for(i=1;i<=n;i++)
   if(v[i]>maxm)
     maxm=v[i];
 while(maxm/exp)
   {long cif[10]={0};
    for(i=1;i<=n;i++)
      cif[(v[i]/exp)%10]++;
    for(i=1;i<=9;i++)
      cif[i]+=cif[i-1];
    for(i=n;i>=1;i--)
      {aux[cif[(v[i]/exp)%10]]=v[i];
        cif[(v[i]/exp)%10]--;
      }
    for(i=1;i<=n;i++)
      v[i]=aux[i];
    exp*=10;
   }
}
int main()
{f>>n;
 for(i=1;i<=n;i++)
    f>>v[i];
 radix();
 for(i=1;i<=n;i++)
    g<<v[i]<<" ";
 f.close();g.close();
 return 0;
}