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.
        Map<Long, Long> map = new HashMap<>();
        map.put(1L, 1L);

        long maxMoves = 0;
        
        for (int i = 0; i < a.length; i++) {
            maxMoves += findMaxMoves(a[i], map);
        }
            
        return maxMoves;
    }
    
    private static long findMaxMoves(long num, Map<Long, Long> map) {
        if (map.containsKey(num))
            return map.get(num);
        
        long maxMoves = 0;
        
        for (long i = 1; i <= num/2; i++) {
            if (num % i == 0) {
                long splits = num/i;
                maxMoves = Math.max(maxMoves, 1 + splits * findMaxMoves(i, map));
            }    
        }
        
        map.put(num, maxMoves);
        return maxMoves;
    }

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