Imagine a list of the first 10^k positive integers, k>12.
Step A: Replace each of the numbers by its s.o.d.
Step B: Unless the list contains only single-digit numbers -
return to Step B.

In the final list - are there more ones than twos or else?

Please comment on your result.