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

public class Solution {

    static long longestSequence(long[] a) {
        //Form prime array
        long ret = 0;
        
        for (int i = 0; i < a.length; i++) {
            long moves = 1;
            long mult = 1;
            while (a[i] != 1) {
                long div = findMaxDivisor(a[i]);
                        
                mult *= div;
                a[i] /= div;
                moves += mult;
            }
           ret+=moves;
        }
        return ret;
    }
    
    static long findMaxDivisor(long n) {
        for (long i = 2; i <= (n / i); i++) {
            if (n % i == 0) {
                n = n / i;
                i--;
            }
                
        }
        return n;
    }

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