Given a positive integer n, return the smallest number x such that x $\geq$ n, and the binary representation of x consists exclusively of set bits ($1$s).

Constraints:

• $1 \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.