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 counter = 0;
        
        for (int i = 0; i < a.length; i++) {
            
            counter = counter + count(a[i]); 
        }
        
        return counter;
    }

    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 long count(long x) {
        
        if (x == 1) {
            
            return 1;
        } else {
            
            long value = divisor(x);
            
            return 1 + value * count(x / value);
        }
    }
    
    static long divisor(long x){
        
        long v = 2;
        
        long result = 0;
        
        while (x > 1) {
            
            while (x % v == 0) {
                
                result = v;
                x = x / v;
            }
        
            if (v > 2) {
                
                v = v + 2;
            } else {
                
                v = 3;
            }
        }
        
        return result;
    }
}