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, \dots , a_k$ are simple.