2. On the table there are 2016 coins. Two players play the following game making alternating moves. In one move it is allowed to take 1,2 or 3 coins. The player who takes the last coin wins. Which player has a winning strategy?
2. The second one. If the first player takes $x$ coins, the second should take $4-x$. Then after a move of the first player the number of coins will never be divisible by 4 , while it will be after every move of the second player. Hence it is the second player who takes the last coin.