Advanced Number Theory · Challenge problem

For a positive integer $n$, let $s(n)$ denote the sum of the decimal digits of $n$. How many positive integers $n < 10^4$ satisfy $s(2n) = 2\,s(n)$?