Consider the following two-player game. There are two piles of matches. Initially each pile contains n matches. Players alternate moves. A move consists of choosing one of the two piles and removing some nonzero number of matches from it. The player who removes the last match wins. Using strong induction, show that the second player always has a winning strategy.