func_code_string: #include <bits/stdc++.h>   using namespace std;   const int N = 2e5 + 5;   long long mpow(long long x, long long y) {     long long res = 1;     x = x % 1000000007;     while (y) {       if (y & 1) {         res *= x;         res = res % 1000000007;       }       x *= x;       x %= 1000000007;       y >>= 1;     }     return res;   }   bool isprime(long long n) {     for (long long i = 2; i * i <= n; i++) {       if (n % i == 0) return false;     }     return true;   }   long long gcd(long long a, long long b) {     if (b == 0)       return a;     else       return gcd(b, a % b);   }   void solves_1() {     long long n;     cin >> n;     vector<long long> v(n);     for (int i = 0; i < n; i++) cin >> v[i];     sort(v.rbegin(), v.rend());     set<long long> st;     long long tmp = 0;     for (int i = 0; i < n; i++) {       if (st.find(v[i]) != st.end()) continue;       st.insert(v[i]);       while (v[i] % 2 == 0) {         v[i] /= 2;         tmp++;         st.insert(v[i]);       }     }     cout << tmp << endl;     return;   }   int main() {     ios::sync_with_stdio(false);     cin.tie(NULL);     ;     long long t;     cin >> t;     while (t--) solves_1();     return 0;   }   