import java.util.HashMap;
import java.util.Scanner;
import java.util.ArrayList;
public class BreakingSticks {

    static HashMap<Long,Long> d=new HashMap<>();
    static long solve(long[] a){
        long sum=0;
        for(int i=0;i<=a.length-1;++i)
            sum+=stickMove(a[i]);
        return sum;
    }

    private static long stickMove(long a) {
        if(a==1)return  1;
        if(d.get(a)==null){
            long mxP=primeA(a).stream().max(Long::compareTo).get();
            long r=a/mxP;
            long ans=stickMove(r)*mxP+1;
            d.put(a,ans);
        }
        return d.get(a);

    }

    public static ArrayList<Long> primeA(long n){
        ArrayList<Long> A=new ArrayList<>();
        long d=2;
        while(1<n){
            while(n%d==0){
                A.add(d);
                n/=d;
            }
            d+=1;
            if(n<d*d){
                if(1<n)
					A.add(n);
                break;
            }
        }
        return A;
    }
    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 ansult=solve(a);
        System.out.println(ansult);
        in.close();
    }
}