HMMT November 2019 T4

Two players play a game, starting with a pile of $N$ tokens. On each player's turn, they must remove $2^{n}$ tokens from the pile for some nonnegative integer $n$. If a player cannot make a move, they lose. For how many $N$ between 1 and 2019 (inclusive) does the first player have a winning strategy?