Two players in turn put two or three coins into their own hats (before the game starts, the hats are empty). Each time, after the second player duplicated the move of the first player, they exchange hats. The player wins, if after his move his hat contains one hundred or more coins. Which player has a winning strategy?
Problem
Source: Kyiv mathematical festival 2017
Tags: Kyiv mathematical festival, combinatorics, game