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

public class Solution {

    static long longestSequence(long[] a) {
        long count=0;
        for(long num : a){
            if(num==1) count=1;
            else if(num%2!=0) count+=num+1;
            else{
                long temp=num;
                long prod=1;
                while(temp%2==0){
                    prod*=2;
                    temp/=2;
                }
                long partitions=num/prod;
                while(prod!=0){
                    count+=partitions;
                    partitions*=2;
                    prod/=2;
                }
                count++;
            }
        }
        return count;
    }

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