Induction · Challenge problem

In a take-away game, a player may remove $1$, $3$ or $4$ stones; whoever takes the last stone wins. Strong induction on the pile size classifies every position. For how many starting piles $n$ with $1 \le n \le 100$ does the player to move LOSE?