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

public class Solution {

    static long longestSequence(long[] a) {
        //  Return the length of the longest possible sequence of moves.
        long sum = 0;
        for(long lng : a){
            while( lng != 1){
                sum = sum + lng;
                lng = lng/getSmallestDiv(lng);
            }
            sum = sum + lng;
        }
        return sum;
    }

    public static long getSmallestDiv(long n) {
        if (n % 2 == 0) {
            return 2;
        }
        for (long i = 3; i <= (long) Math.sqrt(n); i += 2) {
            if (n % i == 0) {
                return i;
            }
        }
        return n;
    }
    
    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();
    }
}