Problem-Solving Strategies · Hard problem

A pile has $n$ counters. A move removes ONE counter, or, if the pile is even, removes HALF of it. Whoever takes the last counter wins. For how many $n$ from $1$ to $30$ does the SECOND player win?