Sunita and Mohammed play a game where they start with a pile of candy and take turns eating a prime number of pieces of candy from the pile. A player who leaves 0 or 1 candies in the pile after their move wins. If Sunita and Mohammed both play perfectly and Mohammed goes first, and the pile has 1000 candies, who has the winning strategy?