A meal is defined as a good meal if it consists of exactly two different food items whose sum of deliciousness values equals a power of $2$ (that is, $2^k$ for some non negative integer $k$).

Given an integer array deliciousness, where deliciousness[i] represents the deliciousness value of the food item at index i, return the total number of distinct pairs that form a good meal modulo $10^9 + 7$.

Note: Pairs with different index combinations are considered distinct even if the corresponding food items have identical deliciousness values.

Constraints:

• $1 \leq$ deliciousness.length $\leq 10^5$

• $0 \leq$ deliciousness[i] $\leq 2^{20}$

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.