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

public class Solution {
    static long log2(long n)
    {
        return (long)(Math.log(n) / Math.log(2));
    }
    static long longestSequence(long[] a) {
        //  Return the length of the longest possible sequence of moves.
        long ans = 0;
        for(int i=0;i<a.length;i++)
        {
            ans = ans + 1;
            if(a[i] == 1)
            {
                continue;
            }
            else if(a[i] % 2 != 0)
            {
                ans = ans + a[i];
            }
            else
            { 
                long limit = log2(a[i]);
               // System.out.println("limit "+limit);
                if(a[i] % ((long)Math.pow(2,limit)) != 0 )
                {
                    while(a[i] % ((long)Math.pow(2,limit)) != 0 )
                    {
                        limit--;
                    }
                }
                limit = (long)Math.pow(2,limit);
                long tmp = a[i] / limit;
                while(tmp <= a[i])
                {
                    //System.out.println("tmp "+tmp);
                    ans = ans + tmp;
                    tmp = tmp * 2;
                }
            }
           // System.out.println(ans);
        }
        return ans;
    }

    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();
    }
}