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 n) {
        //  Return the length of the longest possible sequence of moves.
    	long result=0;
    	long res=0;
    	for (int i=0;i<n;i++)
    	{
    		long num=a[i];
    		res=num;
    		while (num!=1)
    		{
    			if (isPrime(num))
    			{
    				res=res+1;
    				break;
    			}
    			else
    			{
    				for(int d=2;d<num;d++)
    				{
    					if(num%d==0)
    					{
    						num=num/d;
    						res=res+num;
    						break;
    					}
    				}
    			}
    			
    		}
    		
    		
    		result=result+res;
    	}
    	return result;
    }

    static boolean isPrime(long n)
	{
    	if((n > 2 && n % 2 == 0) || n == 1) {
            return false;
        }

        for (int i = 3; i <= (int)Math.sqrt(n); i += 2) {
        	if (n % i == 0) {
                return false;
            }
        }

        return true;
       
	}
    
    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,n);
        System.out.println(result);
        in.close();
    }
}