Let us play a Game

Chef and his friend are playing a very unusual game. There is an integer n. Also, there are 3 more integers namely a b c. This is a 2-player game. On every turn, a player can make any of the following moves: Move 1->n=n-a Move 2->n=n-b. Move 3->n=n-c. The player who can make n=0 in any of his turns wins. Also, if a player cannot decrease n further without making it negative, the other player