Chips

Zach and Cody are playing a game. There are initially N chips on a table. Zach starts the game making the first move. In each turn one has to choose a move from a set of moves. The set of moves consists of all the moves of removing pk chips from the table, where p is any prime and k is any non negative integer. The winner is the one to take the last chip. Can you decide who will win the game, assu