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

public class Solution {

    static long solve (long n){
        int count=0;long x=n;
       
        
        while(n>1){
            
            if((n%(n/2)==0)){
                count+=n/2;
            }
            n>>=1;
        }
        //System.out.print(" "+count+" ");
        return count+x;
    }
    static long longestSequence(long[] a,int n) {
        long sum=0;
        for(int i=0;i<n;i++){
            sum+=solve(a[i]);
        }
        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,n);
        System.out.println(result);
        in.close();
    }
}