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 sum=0L;
        for(int i=0;i<a.length;i++)
        {if(a[i]%2==0)
           {for(long j=a[i];j>=1;j=j/2)
             {sum=sum+j;
              }   
           }
         else
           {if(a[i]%2==1)
           { sum=sum+a[i];
              if(a[i]!=1)
              {sum=sum+1;}}}}
        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();
    }
}