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 sum=0;
        for(int i=0;i<a.length;i++)
        {
            if(countdivisor(a[i])-2==0)
                sum+=a[i]+1;
            else if((a[i] & a[i]-1) ==0)
                sum+=2*a[i]-1;
            else
            {
               long no=a[i] & (-a[i]);
         
                sum=sum+1+(a[i]/no)*(2*(no) -1);
            }
        }
        return sum;
    }
    public static long countdivisor(long n)
    {  
        long count=0;
        for(long i=1;i<=(long)Math.sqrt(n);i++)
        {
            if(n/i==i){
                count=count++;
            }
            else if(n%i==0)
                count+=2;
        }
        return count;
    }
    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();
    }
}