For each element in an array of

n

$$integers$,$ arr, express the element as the sum of

k

$$integers$,$ Le

$.$

$,$

$$arr

$[$i$]$

$=$

$$

$1$

$+$

$$

$2$

$+$

$$

$3$

$+$

dots

$+$

$$int

k

$$that satisfy these conditions.

Each of the

k

$$integers is greater than

$0($

in

$[$

it

$]$

$>$

$0$

$$for

$1$

$<=$

$1$

$<=$

k $)$

$.$

Exactly

$($k

$-$

$1)$

$$integers are even powers of

$2$

$.$

$$That is

$,$

$2$

$2$

$,$

$2$

$4$

$,$

$$and

$50$

$$on

$.$

The value of exactly one of the

k

$$integers

$15$

$$less than

$4$

$.$

Note:

$0$

$$is not an even power for this challenge.

Find the minimum possible value of

k

$$for each element in the array. If an element cannot be expressed as required, return

$-$

$$I for that element.