There is a 1 x n rectangular region which consists of n unit squares. We start by putting n coins on each square. Each player then takes turns to remove 1 or 2 adjacent coins. Once a coin is removed, the coins to the left and to the right of the removed coin are not considered to be adjacent. For n =10, determine who has a winning strategy and find his/her winning strategy