Induction · Superchallenge problem

In a game, a player may remove any positive perfect square number of stones ($1, 4, 9, \ldots$); whoever takes the last stone wins. Classify positions by strong induction on the pile size. For how many piles $n$ with $1 \le n \le 50$ does the player to move LOSE?