#include <iostream>
#include <fstream>
#include<cstdlib>
using namespace std;

ifstream fin ("algsort.in");
ofstream fout ("algsort.out");
int a[500000], ordonat[500000];
int put10[10]={1, 10, 100, 1000, 10000, 100000, 1000000, 10000000, 100000000, 1000000000};

void counting_sort(int v[], int right, int exp)
{
    int freq[10]={0};
    int i;
    for(i=0 ; i<=right ; i++)
        freq[(v[i]/put10[exp])%10]++;
    for(i=1 ; i<10 ; i++)
    {
         freq[i]+=freq[i-1];
    }
    for(i=right ; i>=0 ; i--)
    {
        ordonat[freq[(v[i]/put10[exp])%10]-1]=v[i];
        freq[(v[i]/put10[exp])%10]--;
    }
    for(i=0 ; i<=right ; i++)
         v[i]=ordonat[i];
}
int maxx;
void ridiche_sort(int v[], int right)
{
    int j;
    for(j=0 ; j<10 && put10[j]<=maxx ; j++)
        counting_sort(a, right, j);
}

int main()
{
    int i,n;
    fin >>n;
    maxx=0;
    for(i=0;i<n;i++)
    {
        fin >> a[i];
        if(maxx<a[i])
            maxx=a[i];
    }

    ridiche_sort(a, n-1);
    for(i=0;i<n;i++)
        fout << ordonat[i] << " ";

    return 0;
}