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 = 0;
        for (long b : a) {
            sum += moves(b);
        }
        return sum;
    }
    
    static long moves(long a) {
        long moves = a;
        long pieces = a;
        while (pieces > 1) {
            if (pieces % 2 == 0) {
                moves += pieces / 2;
                pieces = pieces / 2;
            } else {
                moves += (pieces - 1) / 2;
                pieces = (pieces - 1) / 2;
            }
        }
        
        return moves;
    }

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