ELMO SL 2017 C3

Consider a finite binary string $b$ with at least $2017$ ones. Show that one can insert some plus signs in between pairs of digits such that the resulting sum, when performed in base $2$ , is equal to a power of two.

[i]Proposed by David Stoner