You are given an array A consisting of $2 \cdot N$ integers.

You can perform the following operation any number of times.
Choose any i (1 ≤ i ≤ $2 \cdot N)$ such that A_{i} is even and divide A_{i} by 2.
Or choose any i (1 ≤ i ≤ $2 \cdot N)$ and multiply A_{i} by 2.

Find the minimum number of operations required to make the number of even elements and number of odd elements in the array equal.

------ Input Format ------

• The first line contains a single integer T — the number of test cases. Then the test cases follow.
• The first line of each test case contains an integer N — the size of the array A is $2 \cdot N$.
• The second line of each test case contains $2 \cdot N space-separated integers A_{1}, A_{2}, \dots, A_{2 \cdot N}$ denoting the array A.

------ Output Format ------

For each test case, output on a new line the minimum number of operations required to make the number of even elements and number of odd elements in the array equal.

------ Constraints ------

$1 ≤ T ≤ 10^{5}$
$1 ≤ N ≤ 10^{5}$
$1 ≤ A_{i} ≤ 10^{9}$
- The sum of $N$ over all test cases is at most $10^{5}$.

----- Sample Input 1 ------
3
3
1 2 3 4 5 6
3
1 3 4 8 2 6
3
1 5 3 5 6 7

----- Sample Output 1 ------
0
1
2
----- explanation 1 ------
Test case 1: No operations are required since there are already an equal number of odd elements and even elements.

Test case 2: One operation is enough. It can be seen that the number of odd and even elements in the resulting array are equal.

$[1, 3, 4, 8, \underline{2}, 6] \xrightarrow[\div 2]{i = 5} [1, 3, 4, 8, 1, 6]$

Test case 3: Here two operations are enough to make the number of odd and even elements in the resulting array equal.

1st operation: $[ 1, 5, 3,\underline{5}, 6, 7] \xrightarrow[\times 2 ]{i = 4} [1, 5, 3, 10, 6, 7]$

2nd operation: $[ 1, 5, 3, 10, 6, \underline{7}] \xrightarrow[\times 2 ]{i = 6} [1, 5, 3, 10, 6, 14]$

见题面

见题面