import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] array = new int[n];

        int ans = 0;

        for(int i=0; i<n; i++){
            int input = sc.nextInt();
            array[i] = input;
        }

        for(int i=0; i<n; i++){
            ans += search(array, 0, i);
        }


        System.out.println(ans);
    }
    public static int search(int[] array, int count, int index){
        if(array[index] % 2 != 0){
            return count;
        } else {
            array[index] /= 2;
            count++;
            return search(array, count, index);
        }
    }
} import java.util.Scanner; Scanner java.util public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] array = new int[n];

        int ans = 0;

        for(int i=0; i<n; i++){
            int input = sc.nextInt();
            array[i] = input;
        }

        for(int i=0; i<n; i++){
            ans += search(array, 0, i);
        }


        System.out.println(ans);
    }
    public static int search(int[] array, int count, int index){
        if(array[index] % 2 != 0){
            return count;
        } else {
            array[index] /= 2;
            count++;
            return search(array, count, index);
        }
    }
} Main public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] array = new int[n];

        int ans = 0;

        for(int i=0; i<n; i++){
            int input = sc.nextInt();
            array[i] = input;
        }

        for(int i=0; i<n; i++){
            ans += search(array, 0, i);
        }


        System.out.println(ans);
    } main {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] array = new int[n];

        int ans = 0;

        for(int i=0; i<n; i++){
            int input = sc.nextInt();
            array[i] = input;
        }

        for(int i=0; i<n; i++){
            ans += search(array, 0, i);
        }


        System.out.println(ans);
    } Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int n = sc.nextInt(); n sc.nextInt() sc.nextInt sc int[] array = new int[n]; array new int[n] n int ans = 0; ans 0 for(int i=0; i<n; i++){
            int input = sc.nextInt();
            array[i] = input;
        } int i=0; int i=0; i 0 i<n i n i++ i++ i {
            int input = sc.nextInt();
            array[i] = input;
        } {
            int input = sc.nextInt();
            array[i] = input;
        } int input = sc.nextInt(); input sc.nextInt() sc.nextInt sc array[i] = input array[i] array i input for(int i=0; i<n; i++){
            ans += search(array, 0, i);
        } int i=0; int i=0; i 0 i<n i n i++ i++ i {
            ans += search(array, 0, i);
        } {
            ans += search(array, 0, i);
        } ans += search(array, 0, i) ans search(array, 0, i) search array 0 i System.out.println(ans) System.out.println System.out System System.out ans String[] args args public static int search(int[] array, int count, int index){
        if(array[index] % 2 != 0){
            return count;
        } else {
            array[index] /= 2;
            count++;
            return search(array, count, index);
        }
    } search {
        if(array[index] % 2 != 0){
            return count;
        } else {
            array[index] /= 2;
            count++;
            return search(array, count, index);
        }
    } if(array[index] % 2 != 0){
            return count;
        } else {
            array[index] /= 2;
            count++;
            return search(array, count, index);
        } array[index] % 2 != 0 array[index] % 2 array[index] array index 2 0 {
            return count;
        } return count; count {
            array[index] /= 2;
            count++;
            return search(array, count, index);
        } array[index] /= 2 array[index] array index 2 count++ count return search(array, count, index); search(array, count, index) search array count index int[] array array int count count int index index public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] array = new int[n];

        int ans = 0;

        for(int i=0; i<n; i++){
            int input = sc.nextInt();
            array[i] = input;
        }

        for(int i=0; i<n; i++){
            ans += search(array, 0, i);
        }


        System.out.println(ans);
    }
    public static int search(int[] array, int count, int index){
        if(array[index] % 2 != 0){
            return count;
        } else {
            array[index] /= 2;
            count++;
            return search(array, count, index);
        }
    }
} public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] array = new int[n];

        int ans = 0;

        for(int i=0; i<n; i++){
            int input = sc.nextInt();
            array[i] = input;
        }

        for(int i=0; i<n; i++){
            ans += search(array, 0, i);
        }


        System.out.println(ans);
    }
    public static int search(int[] array, int count, int index){
        if(array[index] % 2 != 0){
            return count;
        } else {
            array[index] /= 2;
            count++;
            return search(array, count, index);
        }
    }
} Main
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] array = new int[n];

        int ans = 0;

        for(int i=0; i<n; i++){
            int input = sc.nextInt();
            array[i] = input;
        }

        for(int i=0; i<n; i++){
            ans += search(array, 0, i);
        }


        System.out.println(ans);
    }
    public static int search(int[] array, int count, int index){
        if(array[index] % 2 != 0){
            return count;
        } else {
            array[index] /= 2;
            count++;
            return search(array, count, index);
        }
    }
}
