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 res=0;
        int n=a.length;
        int i;
        for(i=0;i<n;i++){
            res+=findmax(a[i]);
        }
        return res;
    }
    static long findmax(long n){
        if(n==1){
            return 1;
        }
        
        if(n==2 || n==3){
            return n+1;
        }
        
        long res=0;
        for(long i=2;i<=(long)Math.sqrt(n)+1;i++){
            if(n%i==0){
                res=(long)Math.max(res,1+(n/i)*findmax(i));
                if(i!=n/i){
                    res=(long)Math.max(res,1+(i)*findmax(n/i));
                }
            }
            
        }
        
        return (long)Math.max(res,1+n);
    }
    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();
    }
}