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 cnt=0;
        long b=0;
          for(long i=0;i<a.length;i++)
          {
              if(a[(int)i]%2==0)
              {
                  long j=0;
                  while(a[(int)i]>(long)Math.pow(2,j))
                  {
                      b=(long)Math.pow(2,j);
                      if(a[(int)i]%b==0)
                      cnt+=(a[(int)i]/b);
                      j++;
                  }
              }
               else{
                   if(a[(int)i]!=1)
                   cnt+=a[(int)i];
               }
          }
        cnt+=a.length;
        return cnt;
        
    }

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