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

public class Solution {

    static long max = Long.MIN_VALUE;

    static long longestSequence(long[] a) {
        //  Return the length of the longest possible sequence of moves.
        long sum = 0;
        for(long e:a){
            sum+=dp(e, 1, 1);    
        }

        //System.out.println("### "+ sum);
        
        return sum;
    }

    static long dp(long n, long count, long sum){
        
        //System.out.println("=>"+n+" "+ sum);
        
        if(n==1){
            max = Math.max(sum, max);
            return max;
        }
        
        for(long i=n/2; i>=1; i--){
            if(n%i==0){
                 //System.out.println("=>"+i+" "+ count +" " +(n/i)*count);
                 dp(i, (n/i)*count, sum + (n/i)*count );
            }
        }
        
        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);
        System.out.println(result);
        in.close();
    }
}