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

public class Solution {

    static int longestSequence(long[] a) {
        //  Return the length of the longest possible sequence of moves.
        Map<Long,Integer> f = new HashMap<Long,Integer>();
        int longSeq = 0;
        for(long e : a){
            longSeq += numMoves(e,f);
        }
        return longSeq;
    }

    private static int numMoves(long x,Map<Long,Integer> f){
        if(f.containsKey(x)){
            return f.get(x);
        }
        int val = 0;
        for(int d = 2; d <= x; d++){
            if(x % d == 0){
                 val = Math.max(d*numMoves(x/d,f),val);
            }
        }
        f.put(x,1 + val);
        return f.get(x);
    }


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