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

public class Solution {

    static long longestSequence(long[] a) {
        //  Return the length of the longest possible sequence of moves.
        long sum = 0;
        for(int idx=0;idx<a.length;idx++){
            if(a[idx]==1)sum++;
            else{
                while(a[idx]>1){
                    sum+=a[idx];
                    a[idx]/=smallestDivisor(a[idx]);
                }
                sum++;
            }
        }
        return sum;
    }

    static long smallestDivisor(long a){
        for(long idx=2;idx<=Math.sqrt(a);idx++){
            if(a%idx==0)return idx;
        }    
        return a;
    }
    
    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();
    }
}