Given an integer n, return the number of integers in the range $[0, `n`]$ that are monobit integers.

An integer is defined as a monobit integer if all the bits in its standard binary representation without leading zeros are identical.

Constraints:

• $0 \leq `n` \leq 1000$

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.