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

public class Solution {

    static long longestSequence(long[] a) {
        int k;
        long i, j, factor, moves = 0;
        for(k = 0; k < a.length; k++){
		  i = a[k];
		  moves += i;
            while(i > 1){
                factor = -1;
                for(j = 2; j <= (long)Math.sqrt(i); j++){
                    if(i % j == 0){
                        factor = j;
                        break;
				    }
                }
                if(factor == -1){
                    factor = i;
			     }
                i /= factor;
                moves += i;
		     }
	   }
    return moves;
    }

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