Olympiad Number Theory · Superchallenge problem

Two players alternately remove $1$, $2$, or $3$ stones from a pile of $20$; the player who takes the last stone wins. Which pile sizes are losing for the player to move? Give the number of losing positions among $1, 2, \ldots, 20$.