import java.util.Collections;
import java.util.PriorityQueue;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner std = new Scanner(System.in);
        int n = std.nextInt();
        PriorityQueue<Integer> queue = new PriorityQueue<>(n, Collections.reverseOrder());
        for (int i = 0; i < n; i++) {
            int val = std.nextInt();
            queue.add(val);
        }

        int count = 0;
        while (!queue.isEmpty()) {
            int v = queue.poll();
            if (v % 2 == 0) {
                int nv = v / 2;
                queue.add(nv);
                count++;
            }
        }

        System.out.println(count);
    }
} import java.util.Collections; Collections java.util import java.util.PriorityQueue; PriorityQueue java.util import java.util.Scanner; Scanner java.util public class Main {
    public static void main(String[] args) {
        Scanner std = new Scanner(System.in);
        int n = std.nextInt();
        PriorityQueue<Integer> queue = new PriorityQueue<>(n, Collections.reverseOrder());
        for (int i = 0; i < n; i++) {
            int val = std.nextInt();
            queue.add(val);
        }

        int count = 0;
        while (!queue.isEmpty()) {
            int v = queue.poll();
            if (v % 2 == 0) {
                int nv = v / 2;
                queue.add(nv);
                count++;
            }
        }

        System.out.println(count);
    }
} Main public static void main(String[] args) {
        Scanner std = new Scanner(System.in);
        int n = std.nextInt();
        PriorityQueue<Integer> queue = new PriorityQueue<>(n, Collections.reverseOrder());
        for (int i = 0; i < n; i++) {
            int val = std.nextInt();
            queue.add(val);
        }

        int count = 0;
        while (!queue.isEmpty()) {
            int v = queue.poll();
            if (v % 2 == 0) {
                int nv = v / 2;
                queue.add(nv);
                count++;
            }
        }

        System.out.println(count);
    } main {
        Scanner std = new Scanner(System.in);
        int n = std.nextInt();
        PriorityQueue<Integer> queue = new PriorityQueue<>(n, Collections.reverseOrder());
        for (int i = 0; i < n; i++) {
            int val = std.nextInt();
            queue.add(val);
        }

        int count = 0;
        while (!queue.isEmpty()) {
            int v = queue.poll();
            if (v % 2 == 0) {
                int nv = v / 2;
                queue.add(nv);
                count++;
            }
        }

        System.out.println(count);
    } Scanner std = new Scanner(System.in); std new Scanner(System.in) int n = std.nextInt(); n std.nextInt() std.nextInt std PriorityQueue<Integer> queue = new PriorityQueue<>(n, Collections.reverseOrder()); queue new PriorityQueue<>(n, Collections.reverseOrder()) for (int i = 0; i < n; i++) {
            int val = std.nextInt();
            queue.add(val);
        } int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
            int val = std.nextInt();
            queue.add(val);
        } {
            int val = std.nextInt();
            queue.add(val);
        } int val = std.nextInt(); val std.nextInt() std.nextInt std queue.add(val) queue.add queue val int count = 0; count 0 while (!queue.isEmpty()) {
            int v = queue.poll();
            if (v % 2 == 0) {
                int nv = v / 2;
                queue.add(nv);
                count++;
            }
        } !queue.isEmpty() queue.isEmpty() queue.isEmpty queue {
            int v = queue.poll();
            if (v % 2 == 0) {
                int nv = v / 2;
                queue.add(nv);
                count++;
            }
        } int v = queue.poll(); v queue.poll() queue.poll queue if (v % 2 == 0) {
                int nv = v / 2;
                queue.add(nv);
                count++;
            } v % 2 == 0 v % 2 v 2 0 {
                int nv = v / 2;
                queue.add(nv);
                count++;
            } int nv = v / 2; nv v / 2 v 2 queue.add(nv) queue.add queue nv count++ count System.out.println(count) System.out.println System.out System System.out count String[] args args public class Main {
    public static void main(String[] args) {
        Scanner std = new Scanner(System.in);
        int n = std.nextInt();
        PriorityQueue<Integer> queue = new PriorityQueue<>(n, Collections.reverseOrder());
        for (int i = 0; i < n; i++) {
            int val = std.nextInt();
            queue.add(val);
        }

        int count = 0;
        while (!queue.isEmpty()) {
            int v = queue.poll();
            if (v % 2 == 0) {
                int nv = v / 2;
                queue.add(nv);
                count++;
            }
        }

        System.out.println(count);
    }
} public class Main {
    public static void main(String[] args) {
        Scanner std = new Scanner(System.in);
        int n = std.nextInt();
        PriorityQueue<Integer> queue = new PriorityQueue<>(n, Collections.reverseOrder());
        for (int i = 0; i < n; i++) {
            int val = std.nextInt();
            queue.add(val);
        }

        int count = 0;
        while (!queue.isEmpty()) {
            int v = queue.poll();
            if (v % 2 == 0) {
                int nv = v / 2;
                queue.add(nv);
                count++;
            }
        }

        System.out.println(count);
    }
} Main
import java.util.Collections;
import java.util.PriorityQueue;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner std = new Scanner(System.in);
        int n = std.nextInt();
        PriorityQueue<Integer> queue = new PriorityQueue<>(n, Collections.reverseOrder());
        for (int i = 0; i < n; i++) {
            int val = std.nextInt();
            queue.add(val);
        }

        int count = 0;
        while (!queue.isEmpty()) {
            int v = queue.poll();
            if (v % 2 == 0) {
                int nv = v / 2;
                queue.add(nv);
                count++;
            }
        }

        System.out.println(count);
    }
}
