Question 137
A positive integer is called simple if its ordinary decimal representation consists entirely of zeroes and ones. Find the least positive integer $k$ such that each positive integer $n$ can be written as $n = a_{1} \pm a_{2} \pm a_{3} \pm \cdots \pm a_{k}$, where $a_{1}, \ldots, a_{k}$ are simple.