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 totalSum=0;
        
        for(int i=0;i<n;i++){
         long sum=0;       
        long temp=a[i];
       /*  long p=prime(temp);   */
            if(a[i]==1){
                totalSum++;
            }                           
   
        /*  else if(p==1){
                totalSum=a[i]+1;
            }    */   
            else{
                for(long d=a[i]/2;d>=1;d--){
                    
                   long max=0;
                    long temp2=d;
                if(a[i]%d==0){
                    max++;
                    while(temp2>=1){
                        max=max+temp/temp2;
                        temp2=temp2/2;
                    }
                }
                       
                    if(max>sum){
                        sum=max;
                    }
                }
            }
            totalSum=totalSum+sum;
        }
        return totalSum;
    }                                
  /*public static long prime(long t){
        long count=0,m=0;
        for(long i=2;i<=t/2;i++){
            if(t%i==0){
                count++;
            }
        }
        if(count==0){
            m=1;
        }
        else{
            m=0;
        }
        return m;
    }   */

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