You are given two integers num1 and num2.

In a single operation, you may select any integer i within the range $[0, 60]$ and subtract $(2^i + \text{`num2`})$ from num1.

Determine the minimum number of operations required to reduce num1 to exactly $0$.

If it is not possible to make num1 equal to $0$, return $-1$.

Note: In each operation, you are free to choose a different value of i.

Constraints:

• $1 \leq$ num1 $\le 10^9$ ...