import java.util.ArrayList;
import java.util.Scanner;

public class BreakingSticks {

	static ArrayList<Integer> criba;
	
	static long longestSequence(long[] a) {
        long suma=0;
        for (int i = 0; i < a.length; i++) {
			long actual=a[i];
			int index=0;
			while(actual!=1&&index<criba.size()) {
				while(actual%criba.get(index).longValue()==0) {
					suma+=actual;
					actual/=criba.get(index).longValue();
				}
				index++;
			}
			suma+=actual;				
			if(actual!=1) {
				suma+=1;
			}
		}
        return suma;
    }

    public static void main(String[] args) {
    		generarCriba();
    		
        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();
    }
    
    static void generarCriba() {
    	
    		criba=new ArrayList<Integer>();
    		int b=100000000;
    		int x[]= new int[b];
		x[0]=1;
		x[1]=1;
		x[2]=0;
		
		for (long y = 0; y * y < b; y++){
			
			if (x[((int)y)]!=1){
				criba.add(((int)y));
				for (long z = y * y; z < x.length; z += y){
					x[((int)z)]=1;
				}
			}
		}
		
		
    }
    
}