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

public class Solution {

    
    static long f(long n, Map<Long,Long> dp)
    {
        
        if(n==1)
        {
            return 1;
        }
        
        if(dp.get(n)!=null)
        {
            return dp.get(n);
        }
        
        
        
        long ans=0;
        
        ans=1+n*f(1,dp);
        for(long i=2;i<=Math.sqrt(n);++i)
        {
            if(n%i!=0)
            {
                continue;
            }
            long f1=i;
            long f2=n/i;
                  
            ans=Math.max(     ans,   Math.max(     1+ ( f2*f(f1,dp) )  ,  1+ ( f1*f(f2,dp) )  )    );
            
        }
        
        dp.put(n,ans);
        return ans;
        
    }
    
    
    static long longestSequence(long[] a,int n) {
        //  Return the length of the longest possible sequence of moves.
        long sum=0;
        Map<Long,Long> dp=new HashMap<Long,Long>();
        //Map<Long,Long> ans=new HashMap<Long,Long>();
        
        for(int i=0;i<n;++i)
        {
            if(dp.get(i)==null)
            {
                sum+=f(a[i],dp);
            }
           
            else
            {
                sum+=dp.get(i);
            }
                
        }
        return sum;
    }

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