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

public class Solution {
    
    public static List<Long> primeFactors(long n)
    {
        List<Long> list = new ArrayList();
        while (n%2==0)
        {
            list.add(2l);
            n /= 2;
        }
 
        for (int i = 3; i <= Math.sqrt(n); i+= 2)
        {
            while (n%i == 0)
            {
                list.add((long)i);
                n /= i;
            }
        } 
        if (n > 2)
            list.add(n);
        return list;
    }
    
    

    static long longestSequence(long[] a) {
        long ans = 0;
        for(long x : a){
            List<Long> arr = primeFactors(x);
//            for(Long v : arr){
//                System.out.println(v);
//            }
            long temp = x;
            long mult = 1;
            for(int i=arr.size()-1;i >= 0;i--){
                long pr = arr.get(i);
                ans += mult;
                temp /= pr;
                mult *=pr;
            }
            ans += x;
        }
        return ans;
    }

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