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

public class Solution {

    static long longestSequence(long[] a) {
        long c=0;
        for(int i=0;i<a.length;i++){
            c+=count(a[i]);
        }
        return c;
    }
    static long count(long x){
        long c=0;
        if(x==1)
            return 0;
        else
        {
            for(int i=2;i<=x;i++){
                if(x%i==0){
                    c++;
                    x/=i;
                    for(int j=0;j<i;j++)
                        c+=count(x);
                }
            }
        }
        return c;
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        long[] a = new long[n];
        long k=0;
        for(int a_i = 0; a_i < n; a_i++){
            a[a_i] = in.nextLong();
            k+=a[a_i];
        }
        long result = longestSequence(a);
        System.out.println(result+k);
        in.close();
    }
}