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

public class Solution {
    
    static HashMap<Long,Long> hm = new HashMap<>();
    //hm.put(2,3);
    static long calc(long x) {
        if(x == 1) return 1l;
        
        long result = x+1;
        for(int i = 2 ; i<=Math.sqrt(x) ; i++) {
            if(x%i == 0) {
                long t = 0;
                if(hm.containsKey(i)) t = hm.get(i);
                else t = calc(i);
                result = Math.max(result,1+t*(x/i));
                
                if(hm.containsKey(x/i)) t = hm.get(x/i);
                else t = calc(x/i);
                result = Math.max(result,1+t*i);
            }
        }
        hm.put(x,result);
        return result;
    }
    
    static long longestSequence(long[] a) {
        
        long result = 0; 
        for(int i = 0 ; i<a.length ; i++) {
            //System.out.println(calc(a[i]));
            //System.out.println(hm);
            result += calc(a[i]);
        }
        
        return result;
        
    }

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