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

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