Two players play a game with a single integer n. On each turn, the current player must subtract a power of two (1, 2, 4, 8, ...) from n such that the result remains non-negative. The player who makes n become exactly 0 wins.

Both players play optimally. Given the initial integer n, determine whether the first player can force a win.