There are n positive integers a_1, a_2, ..., a_n. 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^4) — 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^5) — the number of integers in the sequence a. The second line contains positive integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 10^9).

The sum of n for all test cases in the input doesn't exceed 2⋅10^5.

Output

For t test cases print the answers in the order of test cases in the input. The answer for the test case is the minimal number of moves needed to make all numbers in the test case odd (i.e. not divisible by 2).

Example

Input


4
6
40 6 40 3 20 1
1
1024
4
2 4 8 16
3
3 1 7


Output


4
10
4
0

Note

In the first test case of the example, the optimal sequence of moves can be as follows:

  * before making moves a=[40, 6, 40, 3, 20, 1]; 
  * choose c=6; 
  * now a=[40, 3, 40, 3, 20, 1]; 
  * choose c=40; 
  * now a=[20, 3, 20, 3, 20, 1]; 
  * choose c=20; 
  * now a=[10, 3, 10, 3, 10, 1]; 
  * choose c=10; 
  * now a=[5, 3, 5, 3, 5, 1] — all numbers are odd. 



Thus, all numbers became odd after 4 moves. In 3 or fewer moves, you cannot make them all odd.
import java.util.*;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class a{
     static int[] count;
     // static int[] count1;
     static long[] arr;
     static char[] c,c1;
     static long[] darr;
     static long x;
     static long maxl;
     static double dec;
     static String s;
     // static long minl;
     static int mx = (int)1e6;
     static long mod = 998244353l;
     // static int minl = -1;
     // static int n;
     static int n;
     static long a;
     static long b;
     // static long c;
     static long d;
     static long y;
     static int m;
     static long k;
     static int q;
     static String[] str,str1;
     static Set<Long> set,set1;
     static Set<Integer> list;
     static Map<Long,Integer> map;
     static StringBuilder sb;

     public static void solve(){

        set = new HashSet<>();
        set1 = new HashSet<>();
        for(int i = 0 ; i < n ; i++){
            set.add(arr[i]);
        }
        long sum = 0;
        for(Long i : set){
            while((i%2 == 0) && (!set1.contains(i))){
                set1.add(i);
                i >>= 1;
                sum += 1;
            }
        }
        System.out.println(sum);

     }

     public static void main(String[] args) {

            // FastScanner sc = new FastScanner();
            Scanner sc = new Scanner(System.in);
            int t = sc.nextInt();
            while(t > 0){
                 // set = new HashSet<>();
                 // map = new HashMap<>();
                
                // x = sc.nextLong();
                // y = sc.nextLong();
                // a = sc.nextLong();
                // b = sc.nextLong();
                
                // c = sc.nextLong();
                // d = sc.nextLong();

                // c = sc.next().toCharArray();
                // s = sc.next();

                 // long x = sc.nextLong();

                n = sc.nextInt();
                // k = sc.nextLong();
                // dec = sc.nextDouble();
                // n = sc.nextLong();
                 
                arr = new long[n];
                for(int i = 0; i < n ; i++){
                    arr[i] = sc.nextLong();
                }
                

                 // darr = new long[n];
                 // for(int i = 0; i < n ; i++){
                 //     darr[i] = sc.nextLong();
                 // }



                // System.out.println(solve()?"Yes":"No");
                solve();
                 // System.out.println(solve());
                 // sb = new StringBuilder();
                 // sb.append(str);

                 t -= 1;
            }

     }

    public static int log(long n){
         if(n == 0)
             return 0;

         if(n == 1)
             return 0;
         if(n == 2)
             return 1;
         double num = Math.log(n);
         double den = Math.log(2);
         if(den == 0)
             return 0;
         return (int)(num/den);
     }

     // public static void swap(int i,int j){
     //     long temp = arr[j];
     //     arr[j] = arr[i];
     //     arr[i] = temp;
     // } 

    static final Random random=new Random();
    
    static void ruffleSort(long[] a) {
        int n=a.length;//shuffle, then sort 
        for (int i=0; i<n; i++) {
            int oi=random.nextInt(n);
            long temp=a[oi];
            a[oi]=a[i]; a[i]=temp;
        }
        Arrays.sort(a);
    }

    static class Node{
        int first;
        int second;
        Node(int f,int s){
            this.first = f;
            this.second = s;
        }
    }

     static class FastScanner {

                BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
                StringTokenizer st=new StringTokenizer("");
                String next() {
                        while (!st.hasMoreTokens())
                                try {
                                        st=new StringTokenizer(br.readLine());
                                } catch (IOException e) {
                                        e.printStackTrace();
                                }
                        return st.nextToken();
                }
                
                int nextInt() {
                        return Integer.parseInt(next());
                }
                int[] readArray(int n) {
                        int[] a=new int[n];
                        for (int i=0; i<n; i++) a[i]=nextInt();
                        return a;
                }
                long nextLong() {
                        return Long.parseLong(next());
                }
        }

}