Question 74
A game is played on an $n \times n$ chessboard. At the start, there are 99 stones on each square. Taking turns, Aimeric and Benoit choose a row or a column and remove one stone from each square of the chosen row or column. They may choose a row or a column only if it has at least one stone on each of its squares. The first player who cannot move loses the game. Aimeric plays the first turn. Determine all $n$ for which Benoit has a winning strategy.