Olympiad Number Theory · Superchallenge problem

Two players alternately remove $1$, $2$, or $3$ stones from a pile; the player who takes the last stone wins. For how many starting pile sizes $n$ with $1 \le n \le 100$ does the SECOND player have a winning strategy?