Question 138
Given a pile of 2000 stones, two players take turns in taking stones from the pile. Each player must remove $1, 2, 3, 4$, or $5$ stones from the pile at each turn, but may not take the same number as his opponent took on his last move. The player who takes the last stone wins. Does the first or second player have a winning strategy?