KöMaL 2013 K373

There are 29 coins lying on a table. Two players take turns removing coins from the table. In each step, the number of coins removed needs to be a positive square number. The player who can last remove some coin(s) will win the game. Which player has a winning strategy? (That is, which player can make sure that he will win the game whatever the moves of the other player are?)