import java.util.Scanner;
import java.util.Stack;


public class Solution {


	static long longestSequence(long[] a) {
		long ans = 0;
		for (int i = 0; i < a.length; i++) {
			long v = a[i];
			Stack<Long> stack = new Stack<>();
			for (long j = 2; j * j <= v; j++) {
				while(v % j == 0) {
					stack.add(j);
					v /= j;
				}
			}
			
			if(v > 1)
				stack.add(v);
			
			long cur = 1;
			ans++;
			while(!stack.isEmpty()) {
				cur *= stack.pop();
				ans += cur;
			}
		}
		
		return ans;
	}

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