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

public class Solution {

    static HashMap<Long , Long> hm = new HashMap<>();
	static long longestSequence(long[] a) {
		long count = 0;
		for (int i = 0; i<a.length; i++) {
			count = count + breakit(a[i]);
			}		
		return count;
        //  Return the length of the longest possible sequence of moves.
    }
	
	static long breakit(long num) {
		
		//long count = 1L;
		//if (num == 1L) { return 1; }		
		//if (num == 2L) { return 2; }

		if( num == 1 ) return  1 ;
        if(hm.get(num) == null){
            Long max = first_prime(num).stream().max(Long::compareTo).get();
            long r = num / max;
            long result = max * breakit(r) + 1;
            //System.out.println("result ->" + result + " leftover = " + r);
            hm.put(num, result);
        }
        return hm.get(num);
	}

    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();
    }
    
    static ArrayList<Long> first_prime(long num)
    {    		
    		ArrayList<Long>factors = new ArrayList<>();
        long f = 2 ;
        while ( num > 1){
            
        		//collect factors
        		while (num % f == 0){
                factors.add(f);
                num = num / f;
            }

            f = f + 1;
            if (f*f > num){
                if (num > 1) factors.add(num);
                break;
            }
        }
        return factors;
    	}
}