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

public class Solution {

    static long longestSequence(long[] a) {
        //  Return the length of the longest possible sequence of moves.
        long[] powerOfTwo = new long[40];
        long two;
        for(int i = 0; i < 40; i++){
            two = (long) Math.pow(2, i);
            powerOfTwo[i] = two;
        }
        
        long sum = 0;
        
        for(int i = 0; i < a.length; i++){
            long l = 0;
            for(int j = 0; j < 40; j++){
                if(powerOfTwo[j] > a[i]){
                    break;
                }
                if(a[i] == 1){
                    l = 1;
                } else if(a[i] % powerOfTwo[j] == 0){
                    long remainder = a[i] / powerOfTwo[j];
                    l = powerOfTwo[j] * 2 - 1;
                    l = l * remainder + 1;
                }
            }
            sum += l;
        }
        
        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();
    }
}