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

public class Solution {

    static long  findsmallestdenom(long k) {

        long return_val=k;
        if (k%2 ==0)
            return_val= 2;
        else
        {
            long sqr = (long) Math.floor(Math.sqrt(k));
            for(int j=3;j<=sqr;j=j+2)
            {
                if (k%j==0) {
                    return_val = j;
                    break;
                }
            }
        }
        return return_val;

    }
    
    static long longestSequence(long[] a) {
        //  Return the length of the longest possible sequence of moves.
        
        long counter=0;
        for (int i=0; i<a.length;i++)
        {
            long Y = a[i];
            long remainder = Y;
            counter++;
            while (remainder>1)
            {
                long tmp = findsmallestdenom(remainder);

               // System.out.println(tmp);
                remainder = remainder / tmp;
                if(remainder !=1) counter += remainder;
            }
            if(Y>1)
            counter +=Y;

        }
        return counter;
        
    }

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