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

public class Solution {
    
    static long getMoves(long a)
    {
        if(a==1)
            return 1;
        
        int returnMoves=0;
        
        for(int div=2;div<=a;div++)
        {
            if(div==a)
                return a+1;
            if(a%div==0)
            {
                for(int i=0;i<a/div;i++)
                {
                    returnMoves+=getMoves(div);
                }
                
                return returnMoves+1;
                
            }
            
        }
        
        return returnMoves;
        
    }

    static long longestSequence(long[] a) {
        //  Return the length of the longest possible sequence of moves.
        int moveCount=0;
        for(int i=0;i<a.length;i++)
        {
            moveCount+=getMoves(a[i]);
        }
        
        return moveCount;
    }

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