You are given an integer array nums of length n, which is a permutation of the integers from $0$ to $n - 1$.

You can choose a non negative integer k. In one operation, you may swap two elements nums[i] and nums[j] if nums[i] & nums[j] == k. You can perform this operation any number of times.

Return the maximum value of k such that nums can be sorted in ascending order.

Constraints:

• $1 \leq n ==$ nums.length $\leq 10^5$

• $0 \leq$ nums[i] $\leq n - 1$

• nums is a permutation of integers from $0$ to $n - 1$.

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.