Two players play a game with a single pile of n stones. On each turn, a player must remove 1, 2, or 3 stones from the pile. However, there is an additional rule: a player may never remove more stones than the current pile size. The player who takes the last stone wins the game.

Both players play optimally. Given the initial number of stones n, determine whether the first player can force a win.