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

public class Solution {

    static ArrayList<Long> retrievePrimeFactors(long n)
    {
        ArrayList<Long> result = new ArrayList();

        long copyOfInput = n;
        
        while (copyOfInput%2 == 0)
        {
            result.add((long)2);
            copyOfInput /= 2;
        }
        
        //copyOfInput must be odd at this point
        for (long i = 3; i <= Math.sqrt(copyOfInput); i = i+2)
        {
            // While i divides n, print i and divide n
            while (copyOfInput%i == 0)
            {
                result.add(i);
                copyOfInput = copyOfInput/i;
            }
        }
        
        // This condition is to handle the case when n 
        // is a prime number greater than 2
        if (copyOfInput > 2)
            result.add(copyOfInput);
        
        return result;
    }
    
    static long moves(long n)
    {
        ArrayList<Long> primefactors = retrievePrimeFactors(n);
        Collections.sort(primefactors, Collections.reverseOrder());
        
        long count=1;
        long num=1;
        for (int i=0; i<primefactors.size(); ++i)
        {
            long curr = primefactors.get(i) * num;
            count += curr;
            num = curr;
        }
        
        return count;
    }
    
    static long longestSequence(long[] a) 
    {
        long count = 0;
        for (int i=0; i<a.length; ++i)
        {
            count += moves(a[i]);
        }
        return count;
    }

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