#include <fstream>
using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");
uint32_t *v = new uint32_t[10000000];
int n;

void CountSort(int exp)
{
    uint32_t *v2, cont[256] = { 0 };
    v2 = new uint32_t[n];
    int i;
    for (i = 0; i < n; i++) cont[(v[i] >> (exp*8)) % 256]++;
    for (i = 1; i < 256; i++) cont[i] += cont[i - 1];
    for (i = n - 1; i >= 0; i--)
    {
        v2[cont[(v[i] >> (exp * 8)) % 256] - 1] = v[i];
        cont[(v[i] >> (exp * 8)) % 256]--;
    }
    for (i = 0; i < n; i++) v[i] = v2[i];
    delete v2;
}

void RadixSort()
{
    int exp;
    for (exp = 0; exp <= 3; exp++)
    {
        CountSort(exp);
    }
}

int main()
{
    in >> n;
    for (int i = 0; i < n; i++) in>>v[i];
    RadixSort();
    for(int i=0;i<n;i++) out<<v[i]<<' ';
    delete v;
    return 0;
}