import java.util.Scanner;

public class Main{
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int N = scan.nextInt();
		long []a = new long[N];
		for(int i = 0; i < N; i++) {
			a[i] = scan.nextLong();
		}
		scan.close();

		long p = 0;
		for(int i = 0; i < N; i++) {
			p += num2(a[i]);
		}

		if(p == 0) {
			System.out.println(0);
		}else {
			System.out.println(p - N);
		}

	}
	public static int num2(long n) {
		for(int i = 1; i < 10000; i++) {
			long t = (long)Math.pow(2, i);
			if(n % t != 0) {
				return i;
			}
		}
		return 0;
	}
}
/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