Induction · Medium problem

Strong induction proves every positive integer is a sum of distinct powers of $2$: subtract the largest power of $2$ not exceeding $n$, and apply the hypothesis to what is left (which is smaller than that power). Following this proof for $n = 1000$, how many powers of $2$ are used?