Math Olympiad problem (Oct 4)

[sirio11]

Two players play a game starting with 153 counters. Taking turns, each player must remove between one and nine counters from the game. The person who removes the last counter wins. Does either the first player or second player have a guaranteed winning strategy, and if so, what is it?