#include <bits/stdc++.h>
using namespace std;
const long long POSITIVE_INFINITY = 9223372036854775807;
const long long NEGATIVE_INFINITY = -9223372036854775807;
const long long MOD = 1000000007;
const long double PI = acos(-1.0);
template <typename T>
inline T bigMod(T A, T B, T M = MOD) {
  A %= M;
  T ret = 1;
  while (B) {
    if (B & 1) ret = (ret * A) % M;
    A = (A * A) % M;
    B = B >> 1;
  }
  return ret;
}
template <typename T>
inline T invMod(T A, T M = MOD) {
  return bigMod(A, M - 2, M);
}
const int N = 200005;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  int tc;
  cin >> tc;
  while (tc--) {
    int n;
    cin >> n;
    vector<int> ar;
    for (int i = 0; i < n; i++) {
      int x;
      cin >> x;
      if (x % 2 == 0) {
        ar.push_back(x);
      }
    }
    n = ar.size();
    sort(ar.rbegin(), ar.rend());
    unordered_map<int, bool> mp;
    long long ans = 0;
    for (int i = 0; i < n; i++) {
      if (mp[ar[i]] == true) {
        continue;
      }
      mp[ar[i]] = true;
      while (ar[i] % 2 == 0) {
        ar[i] /= 2;
        mp[ar[i]] = true;
        ans++;
      }
    }
    cout << ans << '\n';
  }
  return 0;
}
