Two players play a game with a single pile of n stones. On each turn, a player must remove either 1 or 2 stones from the pile. The player who takes the last stone wins the game.

Both players play optimally. Determine whether the first player can force a win given the initial number of stones n.