A and B play the following game: starting with a pile of n stones, A and B take turns, each removing 1, 2, 3 or 4 stones from the pile. The player who removes the last stone loses the game. A goes first.
For which values of n is this game a forced win by B? By A? (Hint: Try small values of n starting
with n = 1. Do you see a pattern?)