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

public class Solution {

    static long longestSequence(int n,long[] a) {
        //  Return the length of the longest possible sequence of moves.
        HashMap<Long,Long> map = new HashMap<>();
        map.put(1L,1L);
        map.put(2L,3L);
        map.put(6L,10L);
        map.put(7L,8L);
        map.put(24L,46L);
        Long total = 0L;
        for(int i=0;i<n;i++)
        {
            if(map.containsKey(a[i]))
                total += map.get(a[i]);
            else
            {
                Long value = func(a[i],map);
                map.put(a[i],value);
                total += value;
            }
        }
        return total;
    }
    
    public static long func(long a,HashMap<Long,Long> map)
    {
        if(map.containsKey(a))
            return map.get(a);
        long val;
        long max = a+1;
        for(long i=2;i<=Math.sqrt(a);i++)
        {
            if(a%i==0)
            {
                val = 1;
                val += i*func(a/i,map); 
                if(max<val)
                    max = val;
                long j = a/i;
                val = 1;
                val += j*func(a/j,map);
                if(max<val)
                    max = val;
            }
        }
        map.put(a,max);
        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(n,a);
        System.out.println(result);
        in.close();
    }
}