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

public class Solution {
    static HashMap<Long,Long> hmap;
    static long longestSequence(long[] a) {
        //  Return the length of the longest possible sequence of moves.
        int n=a.length;
        hmap = new HashMap<Long,Long>();
        long cost=0;
        for(int i=0;i<n;i++){
            cost+=help(a[i])+1;
            //System.out.println(cost);
        }
        return cost;
    }
    static long help(long n){
        if(n==1){
            return 0;
        }
        if(hmap.containsKey(n)){
            return hmap.get(n);
        }
        long max = Long.MIN_VALUE;
        for(int i=2;i<=Math.sqrt(n);i++){
            if(n%i==0){
                long k = Math.max(i+i*help(n/i),n/i+(n/i)*help(i));
                if(max<k){
                    max=k;
                }
            }
        }
        if(max==Long.MIN_VALUE)
        {
            hmap.put(n,n);
            return n;
        }
        hmap.put(n,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(a);
        System.out.println(result);
        in.close();
    }
}