Question 74
On a board the numbers $1, 2, 3, \ldots, 500$ are written. In a game two players $A$ and $B$ take turns alternately and $A$ starts. In each turn they have to erase two numbers $n$ and $2n$ on the board. If a player cannot take a turn, the player loses. Determine who has a winning strategy.