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

public class Solution {
     static long f(long p)
     {
         if(p==1)
         {
             return 1;
         }
         if(p==2)
         {
             return 3;
         }
         if(p%2!=0)
         {
             return p+1;
         }
         return (f(p/2)*2+2);
             
     }
    static long longestSequence(long[] a) {
        long t=0;
        for(int i=0;i<a.length;i++)
        {
            t=t+f(a[i]);
        }
        return t;
    }

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