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

public class Solution {
    
    static long find(long n, Hashtable d){
        if (d.get(n) != null) {
            return (long)d.get(n);
        }
        else {
            long res = n;
            long i = 2;
            int flag = 0;
            while (i<(long)(Math.sqrt(n))+1){
                if (n%i==0){
                    res +=  find((long)(n/i), d);
                    flag = 1;
                    break;
                }else {i += 1;}           
            }
            if (flag == 0) {res += 1;}
            d.put(new Long(n), new Long(res));
            return res;
        }
    }

    static long longestSequence(long[] a, Hashtable d) {
        //  Return the length of the longest possible sequence of moves.
        long s = 0;
        for(int i = 0; i<a.length; i++) {
            s += find(a[i], d);
        }
        return s;
    }

    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();
        }
        Hashtable d = new Hashtable();
        d.put(new Long(1), new Long(1));
        d.put(new Long(2), new Long(3));
        long result = longestSequence(a, d);
        System.out.println(result);
        in.close();
    }
}