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

public class Solution {
    static int prime(long p)
    {
        for(int i=2;i<=(p/2);i++)
        {
            if(p%i==0)
            {
                return 1;
            }
            
        }
        return 0;
    }
    static int small(long q)
    {
        for(int i=2;i<=(q/2);i++)
        {
            if(q%i==0)
            {
                return i;
            }
            
        }
        return 1;
    }
    
    static long longestSequence(long[] a,int n) {
        //  Return the length of the longest possible sequence of moves.
        long sum=0;
        for(int i=0;i<n;i++)
        {
           if(prime(a[i])==0)
           {
               if(a[i]==1)
                   sum=sum+1;
               else
                
               sum=sum+(a[i]+1);
           }
            else
            {
                sum=sum+a[i];
                
                while(a[i]!=1)
                {
                sum=sum+(a[i]/(small(a[i])));
                    
                    a[i]=a[i]/(small(a[i]));
                    if(prime(a[i])==0)
                    {sum=sum+1;
                    break;}
                }
            }
        }
        return sum;
    }

    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,n);
        System.out.println(result);
        in.close();
    }
}