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 rs=0;
        
        int b=a.length;
        for(int j=0;j<b;j++)
        {int i=1;
        while(i<=(a[j]))
        {
            if(a[j]%i==0)
            {
                rs+=a[j]/i;
                i=2*i;
            }
            else{i=i+1;}
        }
        }
        
        return(rs);
    }

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