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

public class Solution {

     static long longestSequence(long[] a) {
        long sum = 0;
        for (long l : a) {
            sum += getMaxPieces(l);
        }
        return sum;
    }

    public static long getMaxPieces(long len) {
        Stack<Long> list = new Stack<>();
        loop:
        while (len > 1) {
            long half = (long) Math.sqrt(len) + 1;
            for (long i = 2; i < half; i++) {
                if (len % i == 0) {
                    list.add(i);
                    len = len / i;
                    continue loop;
                }
            }
            list.add(len);
            len = 1;
        }

        long piecesInBag = 1;
        long piecesTotal = 1;
        while (!list.isEmpty()) {
            long l = list.pop();
            piecesTotal += l * piecesInBag;
            piecesInBag = l * piecesInBag;
        }
        return piecesTotal;
    }

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