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

public class Solution {
    
    static long lowestPrimeFactor(long n) {
        
        for (int i=2; i< (int) Math.sqrt(n) + 1; i++) {
            if ((n / (double) i) % 1 == 0) {
                return i;
            }
        }
        
        return n;
        
    }

    static long longestSequence(long[] a) {
        
        long sum = 0;
        
        for (long n : a) {          // For each stick
            
            long n1 = n;
            
            ArrayList<Long> factors = new ArrayList<Long>();
            
            while (n > 1) {         // Fill list with factors
                long factor = lowestPrimeFactor(n);
                factors.add(factor);
                n /= factor;
            }
            
            for (int i=0; i<factors.size(); i++) {      // Run back through factors
                sum += n1;
                n1 /= factors.get(i);
            }
            
            sum += n1;
            
        }
        
        return sum;
        
    }

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