Two players take turns removing stones from a pile of N stones. On each turn, a player may remove any number of stones that is a power of two: 1, 2, 4, 8, 16, ... (but not more than the pile size). The player who removes the last stone 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.