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 count=0;
        for(int i=0;i<a.length;i++)
        {
            if(a[i]==1)
                count=count+1;
            else
                count=count+divide(a[i])+1;
            
            
        }
        return count;
    }
    
    static long divide(long a){
        int j;
        long max=0;
        long arr[]=new long[(int)a];
        for(int i=0;i<arr.length;i++)
            arr[i]=0;
        if(prime(a))
            return a;
        else
        {
            for(j=2;j<a;j++)
                {
                    if(a%j==0)
                       arr[j]=(a/(long)j)+(a/(long)j)*divide(j);
                }
            for(j=2;j<a;j++)
            {
                if(max<arr[j])
                    max=arr[j];
            }
           
            return max;
        }
    }
    static boolean prime(long a){
        int flag=0;
        long i;
        for(i=2; i<=a/2; ++i)
    {
        
        if(a%i==0)
        {
            flag=1;
            break;
        }
    }

    if (flag==0)
        return true;
    else
        return false;
    }

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