import java.util.Scanner;

class Solver {

    private final int N;
    private final int[] A;

    Solver(Scanner in){
        N = in.nextInt();
        A = new int[N];
        for (int i = 0; i < A.length; i++) {
            A[i] = in.nextInt();
        }
    }

    void solve() {
        int counter = 0;
        for (int value : A) {
            counter += Integer.numberOfTrailingZeros(value);
        }
        System.out.println(counter);
    }
}

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

        new Solver(in).solve();

        in.close();
    }
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz