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.
		// List<Integer> list = new ArrayList<Integer>();
		long sum = 0;

		for (int i = 0; i < a.length; i++) {
			long stickLen = a[i];
			long divisor = 2;
			long stake = stickLen;
			int count = 0;
			while (stake > 1) {
				for (int j = 2; j <= stake; j++) {
					if (stake % j == 0) {
						if (count == 0) {
							// list.add(1);
							sum += 1;
							divisor = j;
							stake = stake / j;
							count++;
						} else {
							divisor = j;
							stake = stake / j;
							sum += (stake * divisor);
							// list.add(new Long(stake*divisor).intValue());
							count++;
						}
						break;
					}
				}

			}
			sum += (stake * stickLen);
            		// list.add(new Long(stake * stickLen).intValue());
		}
		/*
		 * for (Integer item : list) { sum += item; }
		 */
		return sum;
    }

    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();
    }
}