#include <bits/stdc++.h>

using namespace std;

ifstream fin("radixsort.in");
ofstream fout("radixsort.out");

int x;
unordered_map < int, int > freq;
set < int > S;

int main()
{
    while (fin >> x)
    {
        if (freq[x]++ == 0)
            S.insert(x);
    }
    for (auto it: S)
    {
        int N = freq[it];
        for (int i = 1; i <= N; i++)
            fout << it << " ";
    }
    return 0;
}