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

public class Solution {
    static long[] dp=new long[1000001];
    static long longestSequence(long[] a,int n) {
        long sum=0;
        for(int i=0;i<n;i++){
            sum+=function(a[i]);
        }
        return sum;
    }
    static long function(long n){
        if(n==1)return 1;
        if(n==2)return 3;
        if(n==3)return 4;
        long max=n+1;
        long root=(long)Math.sqrt((double) n);
        for(int i=2;i<=root;i++){
            if(n%i==0){
                if(dp[i]==0)
                     dp[i]=function(i);
                long res2=function(n/i);
                long res=Math.max(1+res2*i,1+dp[i]*n/i);
                if(max<res)max=res;
            }
        }
        return max;
    }

    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,n);
        System.out.println(result);
        in.close();
    }
}