You are given an integer n representing the length of an unknown integer array ans. You are also given an integer array sums of size $2^{`n`}$, which contains the sums of all $2^{`n`}$ subsets of ans in no particular order.

Return the array ans. If multiple valid answers exist, return any of them.

Note: The sum of the elements in an empty subset is considered to be $0$.

Constraints:

• $1 \leq$ n $\leq 15$

• sums.length $= 2^{`n`}$

• $-10^4 \leq$ sums[i] $\leq 10^4$

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.