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 A;long[] r=new long[a.length];long sum=0;long result=0;
        for(int i=0;i<a.length;i++)
        {if(a[i]==1)
            r[i]=1;
         else
         {long B=1;
          long b=a[i];long d;
          do{
              d=b/2;
              if(d==1)
              {d=d*a[i];}
              sum=sum+d;
              b=d;
          }while(d==1);sum=sum+a[i];
            r[i]=B+sum; 
         }
      }
        for(int i=0;i<a.length;i++)
        {result=result+r[i];}return(result);
    }

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