There is a pile of N counters. Player 1 starts by removing 1 counter. Player 2 then removes either 1 or 2 counters. Player 1 continues by removing 1, 2 or 3 counters. Player 2 continues by removing from 1-4 counters. The game continues until one player removes the last counter; they are the winner.

For what values of N does Player 1 win, assuming both players are perfect at the game?