write a go solution for Description:
William has array of n numbers a_1,a_2,...,a_n. He can perform the following sequence of operations any number of times:

1. Pick any two items from array a_i and a_j, where a_i must be a multiple of 2
2. a_i=a_i/2
3. a_j=a_j*2

Help William find the maximal sum of array elements, which he can get by performing the sequence of operations described above.

Input Format:
Each test contains multiple test cases. The first line contains the number of test cases t (1<=t<=10^4). Description of the test cases follows.

The first line of each test case contains an integer n (1<=n<=15), the number of elements in William's array.

The second line contains n integers a_1,a_2,...,a_n (1<=a_i<16), the contents of William's array.

Output Format:
For each test case output the maximal sum of array elements after performing an optimal sequence of operations.

Note:
In the first example test case the optimal sequence would be:

1. Pick i=2 and j=1. After performing a sequence of operations a_2=4/2=2 and a_1=6*2=12, making the array look as: [12, 2, 2].
2. Pick i=2 and j=1. After performing a sequence of operations a_2=2/2=1 and a_1=12*2=24, making the array look as: [24, 1, 2].
3. Pick i=3 and j=1. After performing a sequence of operations a_3=2/2=1 and a_1=24*2=48, making the array look as: [48, 1, 1].

The final answer 48+1+1=50.

In the third example test case there is no way to change the sum of elements, so the answer is 10.. Output only the code with no comments, explanation, or additional text.