#include <bits/stdc++.h>
const long long mod = (long long)1e9 + 7;
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    long long ans = 0;
    map<long long, bool> vis;
    vector<long long> v(n);
    for (long long i = 0; i < n; i++) cin >> v[i];
    sort(v.rbegin(), v.rend());
    for (long long i = 0; i < n; i++) {
      while (!vis[v[i]] and v[i] % 2 == 0) {
        vis[v[i]] = 1;
        v[i] /= 2;
        ans++;
      }
    }
    cout << ans << "\n";
  }
  return 0;
}
