Two players take turns removing stones from a single pile. On each turn, a player may remove 1, 2, or 3 stones. The player who removes the last stone wins the game.

Both players play optimally. Given an integer N representing the number of stones, determine whether the first player can force a win.