------
## 最终结论
```python
t = int(input())
results = []

def count_divisions_to_odd(x):
    count = 0
    while x % 2 == 0:
        count += 1
        x //= 2
    return count

for _ in range(t):
    n = int(input())
    a = list(map(int, input().split()))
    
    moves = set()
    
    for number in a:
        if number % 2 == 0:  # Only process even numbers
            moves.add(number)
    
    # For each unique even number, calculate how many times it can be divided by 2 until it becomes odd
    total_moves = sum(count_divisions_to_odd(m) for m in moves)
    
    results.append(total_moves)

print("\n".join(map(str, results)))
```