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

public class Solution {

    static long longestSequence(long[] a) {
        long sum = 0;
        int i=0;
        for(i=0;i<a.length;i++)
            sum +=(a[i]>1?(getMaxMoves(a[i])+1):1);
        return sum;
    }
    
    static long getMaxMoves(long x){
        int i=0;
        long k = (long)Math.sqrt(x)+1;
        for(i=2;i<k;i++){
            if(x%i==0)
                break;
        }
        if(i==k)
            return x  ;
        long q = x/i;
        return x+getMaxMoves(q);
    }

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