Modular Arithmetic · Superchallenge problem

Find the smallest integer $n > 1$ such that $n^2$ ends in the same three digits as $n$ (i.e. $n^2 \equiv n \pmod{1000}$).