Question 52
The numbers $0,1, \ldots, n$ are written on a board. At any moment, Thanima may erase a number if it is the arithmetic mean of two numbers still present on the board. Thanima's goal is to erase as many numbers as possible, and she plays optimally. In terms of $n$, how many numbers remain on the board at the end?