Two players take turns climbing a staircase with N stairs. A coin starts on the ground (step 0). On each turn, a player must move the coin up by exactly 1 or 2 stairs. The player who moves the coin onto the N-th stair 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.