Proof Writing & Problem Solving · Superchallenge problem

A game starts with an integer $n \ge 2$. Players alternate; a move replaces the current number $m$ by $m - d$, where $d$ is a divisor of $m$ with $1 < d < m$. A player who cannot move (the current number is prime) loses. For how many $n$ with $2 \le n \le 100$ can the SECOND player force a win?