Olympiad Number Theory · Superchallenge problem

A coin sits on square $1$ of a $1\times12$ strip. Players alternate moving it $1$ or $2$ squares to the right; whoever moves it onto square $12$ wins. With best play, does the first player win? Answer $1$ for yes, $0$ for no.