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

public class Solution {

   
    static long longestSequence(long[] a,int n) {
        //  Return the length of the longest possible sequence of moves.
        long s=0,temp=0;
        for(int i=0;i<n;i++)
        {
                temp=temp+a[i];
                while(a[i]>0)
                {
                    s=s+(a[i]/2);
                    a[i]=a[i]/2;
                    
                }
            
        }
        s=s+temp;
        return s;
    }

    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,n);
        System.out.println(result);
        in.close();
    }
}