Problem-Solving Strategies · Superchallenge problem

A single token sits on square $12$ of a long strip. A move takes a token on a square $k \ge 3$ and replaces it by one token on square $k - 1$ and one on square $k - 2$ (squares may hold many tokens). When no move is possible, all tokens are on squares $1$ and $2$. How many tokens are on square $2$?