Make Them Odd

Make Them Odd

time limit per test3 seconds
memory limit per test256 megabytes
input: standard input
output: standard output

There are n positive integers a1,a2,…,an. For the one move you can choose any even value c and divide by two all elements that equal c.
For example, if a=[6,8,12,6,3,12] and you choose c=6, and a is transformed into a=[3,8,12,3,3,12] after the move.
You need to find the minimal number of moves for transforming a to an array of only odd integers (each element shouldn’t be divisible by 2).

Input

The first line of the input contains one integer t(1≤t≤10⁴) — the number of test cases in the input. Then t test cases follow.
The first line of a test case contains n(1≤n≤2⋅10⁵) — the number of integers in the sequence a. The second line contains positive integers a1,a2,…,an(1≤ai≤10⁹