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

public class Solution {

    static boolean isPrime(long n){
        long l=2;
        while(l<(int)Math.sqrt(n)+1){
            if(n%l==0)  return false;
            l++;
        }
        return true;
    }
    static long getLow(long n){
        long l=2;
        while(l<(int)Math.sqrt(n)+1){
            if(n%l==0)  return l;
            else l++;
        }
        return 0;
    }
    static long longestSequence(long[] a) {
        long seq=0;
        for(int i=0;i<a.length;i++){
            if(a[i]==1) seq++;
            else if(isPrime(a[i]))  seq+=a[i]+1;
            else{
                seq+=a[i]+1;
                while(!isPrime(a[i])){
                    long lm=getLow(a[i]);
                    seq+=a[i]/lm;
                    a[i]/=lm;
                }
                
            }
        }
        return seq;
    }
    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();
    }
}