Two players take turns removing matchsticks from a pile of N matchsticks. On each turn, a player may remove 1, 2, 3, or 4 matchsticks. The player who removes the last matchstick 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.