import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    static long[] lookup = new long[10000];
    static long longestSequence(long[] a) {
        lookup[0] = 0;
        lookup[1] = 1;
        lookup[2] = 3;
        long sum = 0;
        for(int i=0;i<a.length; ++i) {
            sum += longestSequence(a[i]);
            //System.out.println("sum after index: " + i + ": " + sum);
        }
        return sum;
    }
    
    static long longestSequence(long a) {
        //System.out.println(a);
        long sum = 0;
        if(a < lookup.length && lookup[(int)a] != 0) {
            return lookup[(int)a];
        }

        if(a % 2 != 0) { //odd
            lookup[(int)a] = a + 1;
            sum += lookup[(int)a];
        }
        else { //even
            int n = (int)a & ((int)a ^ ((int)a-1)); //highest power of 2 that divides a[i].
            if(n == a)
                n = n/2;
            if(n < lookup.length && lookup[(int)n] != 0) {
                sum += lookup[(int)n] * (a/n) + 1;
                if(a < lookup.length)
                    lookup[(int)a] = sum;
            }
            else {
                sum += longestSequence(n) * (a/n) + 1;
                if(a < lookup.length)
                    lookup[(int)a] = sum;
            }
        }
        return sum;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        long[] a = new long[n];
        for(int a_i = 0; a_i < n; a_i++){
            a[a_i] = in.nextLong();
        }
        long result = longestSequence(a);
        System.out.println(result);
        in.close();
    }
}