You are given an array nums consisting of prime integers.

You need to construct an array ans of the same length, where ans[i] is the smallest non negative integer that satisfies ans[i] | (ans[i] + 1) == nums[i], where | denotes the bitwise OR operator. If no such value exists for a given index i, set ans[i] to $-1$.

Return the array ans.

Constraints:

• $1 \leq$ nums.length $\leq 100$

• $2 \leq$ nums[i] $\leq 10^9$

• nums[i] is a prime number.

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.