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

public class Solution {

    static long longestSequence(long[] a) {
        ArrayList<Long> fResult = new ArrayList<Long>();
        for(int z = 0; z < a.length; z++){
           long num = a[z];
        //  Return the length of the longest possible sequence of moves.
        ArrayList<Long> result = new ArrayList<Long>();
        while(num%2 == 0){
            long two = 2;
            result.add(two);
            num = num/2;
        }
           
        for (long i =3; i<= Math.sqrt(num);i+=2){
            while(num % i == 0){
                result.add(i);
                num = num / i;
            }  
        }
            
        if (num > 2) result.add(num);
        long output = 0;
        long n = a[z];
        for (int i =0 ; i<result.size();i++){
            output += n;
            n = n / result.get(i);
            
        }
            long oo = output+1;
        fResult.add(oo);    
      }
        
        long o =0;
        for (int i = 0; i <fResult.size();i++){
             o += fResult.get(i);
           
        }
           
       
        return o;
               
    }

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