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 result = 0;
        for (long n : a) {
            result += longestSequence(n);
        }
        return result;
    }

    static long longestSequence(long n) {
        List<Long> factors = factors(n);
        factors.sort(Comparator.reverseOrder());
        long mult = 1;
        long result = mult;
        for (Long factor : factors) {
            mult *= factor;
            result += mult;
        }
        return result;
    }

    static List<Long> factors(long n) {
        List<Long> factors = new ArrayList<>();
        long div = 2;
        while (true) {
            while (n % div == 0) {
                factors.add(div);
                n /= div;
            }
            div++;
            if (n < div * div) {
                if (n != 1) {
                    factors.add(n);
                }
                break;
            }
        }
        return factors;
    }

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