Two players take turns removing candies from a jar containing N candies. On each turn, a player may remove 1, 2, or 3 candies. The player who removes the last candy wins.

Both players play optimally. Given N, determine whether the first player can force a win. Return true if the first player wins, false otherwise.