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 cnt = 0;
        for (long n : a) {
            long num = n;
            HashMap<Long, Long> dp = new HashMap<Long, Long>();
            dp.put((long) 1, (long) 1);
            long dd = 2;
            List<Long> divisors = new ArrayList<Long>();
            long n0 = (long) Math.sqrt(n);
            while (dd <= n0) {
                while (n % dd == 0) {
                    divisors.add(dd);
                    n /= dd;
                }
                dd++;
            }
            if (n > 1) {
                divisors.add(n);
            }
            for (Long d : divisors) {
                HashMap<Long, Long> new_dp = new HashMap<Long, Long>();
                for (Long f : dp.keySet()) {
                    long prod = f * d;
                    if (!new_dp.containsKey(prod)) {
                        new_dp.put(prod, prod + 1);
                    }
                    new_dp.put(prod, Math.max(new_dp.get(prod), dp.get(f) * d + 1));
                }
                for (Long f : new_dp.keySet()) {
                    dp.put(f, new_dp.get(f));
                }
            }
            cnt += dp.get(num);
        }
        return cnt;
    }

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