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 tot=0,n,x;
        int l=a.length;
        long []r=new long[l];
        for(int i=0;i<l;i++)
        {
           n=a[i];
           if(a[i]==1)
           {
               r[i]=1;
           }
            tot=tot+n;
           while(n!=1)
           {
               
               n=n/2;
               //if(n%2==0)
                    tot=tot+n; 
               //else
                   
           }       
           r[i]=tot;
        }
        long c=0;
        for(int j=0;j<l;j++)
        {
            c=c+r[j];
            //System.out.print(r[j]+" ");
        }
        return c;
    }

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