Two players play a game with a stick of integer length N (N >= 2). On each turn, a player must cut the stick at an integer position k (1 <= k < N), breaking it into two shorter sticks of lengths k and N-k. The player then discards one piece and continues with the other piece. The player who, after a cut, leaves a stick of length 1 loses because a stick of length 1 cannot be cut further.

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