Prove the following statement using a strong mathematical induction:

For every ninN,$n$ can be written as a sum of distinct powers of $2.$

As an example, when $n=90,$ we can write $90=2^1+2^3+2^4+2^6,$ where the right$-$hand$-$side is a sum of distinct powers of $2.$