Question 153
At the beginning Alice distributes $1000$ balls into $30$ boxes. After that Alice and Bob alternatively make moves, Alice begins. A person making move chooses a box and takes one ball from the chosen box. A person taking the very last ball from a box takes on that empty box. Find the maximal integer $k$ such that regardless of the strategy of Bob Alice can take at least $k$ boxes.