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.
        int sum = 0;
        for(int i = 0; i < a.length; i++) {
            long val = sequenceForOne(a[i]);
            sum += val;
        }
        return sum;
    }
    
    static long sequenceForOne(long x) {
        if (x == 1) {
            return 1;
        }
        long maxVal = 0;
        boolean found = false;
        for (int i = ((int)x) - 1; i > 1; i--) {
            if (x % i == 0) {
                found = true;
                int sum = 1;
                for (int j = 1; j <= i; j++) {
                    sum += sequenceForOne(x / i);
                }
                maxVal = Math.max(sum, maxVal);
            }
        }
        if (found) {
            return maxVal;
        }
        
        return x + 1;
    }

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