Given an integer n, return the decimal value of the binary string formed by concatenating the binary representations of all integers from $1$ to n in sequential order, modulo $10^9 + 7$.

Constraints:

• $1 \leq$ n $\leq 10^5$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.