#include<cstdio>
#include <queue>
#include<algorithm>
using namespace std;

int N, myArray[1 << 19];

void RadixSort(int v[], int left, int right){
    queue<int> bucket[10];
    int exponent = 1, remainder, maxDigits = 10;

    while(maxDigits--){
        for(int i = left; i <= right; i++){
            remainder = v[i] / exponent % 10;
            bucket[remainder].push(v[i]);
        }int index = -1;

        for(int i = 0; i < 10; i++){
            while(!bucket[i].empty()){
                v[++index] = bucket[i].front();
                bucket[i].pop();
            }
        }exponent *= 10;
    }
}

int main() {

freopen("algsort.in", "r", stdin);
freopen("algsort.out", "w", stdout);

scanf("%d", &N);

for(int i = 0; i < N; i++){
    scanf("%d", &myArray[i]);
}srand(time(NULL));

RadixSort(myArray, 0, N-1);

for(int i = 0; i < N; i++){
    printf("%d ", myArray[i]);
}
return 0;
}