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

public class Solution {
    //largestPrimeFactor
    public static int lpf(long number) { 
        int i; 
        long copyOfInput = number; 
        for (i = 2; i <= copyOfInput; i++) { 
            if (copyOfInput % i == 0) {
                copyOfInput /= i; i--;
            } 
        } 
        return i; 
    }


    
    static long longest(long x) {
       /* if(x%2 != 0){
            if(x == 1){
                return 1;
            }
            return x+1;
        }
        if( x == 2){
            return 3;
        }*/
        if(x == 1){
            return 1;
        }
        int  y = lpf(x);
        
        return 1 + y * longest(x/y);
        
       
        //  Return the length of the longest possible sequence of moves.
    }
    
    static long longestSequence(long[] a) {
        long res = 0L; 
        for(int i = 0 ; i < a.length ;i++  ){
              res = res + longest(a[i]);     
        }
        return res;
        //  Return the length of the longest possible sequence of 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();
    }
}