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 total = 0;
        for (long value : a){
            while (value != 1){
                total += value;
                long limit = (long) (Math.sqrt(value) + 1);
                // Find the next smallest factor (ie equally divides the value)
                for (int i = 2; i <= limit; i++){
                    if (value % i == 0){
                        value = value / i;
                        break;
                    }
                    // Value is prime
                    if (i == limit)
                        value = 1;
                }
            }
            total++;
        }
        return total;
    }

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