import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();

		List<Long> list = new ArrayList<>();
		for (int i = 0; i < n; i++) {
			list.add(sc.nextLong());
		}
		sc.close();

		solve(list);

	}

	static void solve(List<Long> list) {

		int count = 0;

		while (list.size() > 0) {

			for (int i = 0; i < list.size(); i++) {
				long n = list.get(i);
				if (n % 2 != 0) {
					list.remove(i);
				} else {
					list.add(n / 2);
					list.remove(i);
					count++;
				}
			}
		}
		System.out.println(count);

	}
}
/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