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

public class Solution {

	static long longestSequence(long[] a) {
		long sum = 0;
		
		for(long l: a) {
			ArrayList<Long> factors = generateFactorization(l);
			 long curProduct = 1;
			 sum += curProduct;
			 for(int i = factors.size() - 1; i >= 0; i--) {
				 curProduct *= factors.get(i);
				 sum += curProduct;
			 }
		}
		
		return sum;

	}

	private static ArrayList<Long> generateFactorization(long n) {
		ArrayList<Long> factors = new ArrayList<Long>();
		
		while (n % 2 == 0) {
			factors.add((long) 2);
			n /= 2;
		}

		for (long i = 3; i <= Math.sqrt(n); i += 2) {
			while (n % i == 0) {
				factors.add((long) i);
				n /= i;
			}
		}

		if (n > 2) {
			factors.add(n);
		}
		
		return factors;
	}

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

}