#include <deque>
#include <cstdio>

using namespace std;

int a[500010],i, j, n, m, poz, k, t, c;
deque<int> b[15];

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]);
    t = 1;
    do {
    for( i = 0; i<=9 ; ++i) b[i].clear();
      for (i=1; i<=n; ++i)
        b[a[i]/t%10].push_back(a[i]);
      t*=10; k=0;
      for (i = 0; i <= 9; ++i)
        for( j = 0; j< b[i].size(); ++j)
            a[++k] = b[i][j];
    } while (b[0].size()!= n);
    for(i=1; i<=n; ++i) printf("%d ", a[i]);
    return 0;
}