Given a positive integer n, find the maximum integer x such that the bitwise AND of all integers from x to n inclusive evaluates to $0$.

Constraints:

• $1 \leq$ n $\leq 10^{15}$

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.