import java.util.*;
class cutSticks
{
    public static void main(String[] arg)
    {
        Scanner sc=new Scanner(System.in);
       
        int n=sc.nextInt();
        long[] a=new long[n];
        for(int i=0;i<n;i++)
        a[i]=sc.nextLong();
        long moves=0;
        for(int i=0;i<n;i++)
        {
            moves+=calMoves(a[i]);

        }
        System.out.println(moves);
    }
    public static long calMoves(long n)
    {   long mv=0;
        
        while(n>1)
        {
            mv+=n;
            if(isPrime(n))
            break;
            n=n/findFactor(n);
        }
        return mv+1;
    }
    public static boolean isPrime(long n)
    {   int flag=0;
        for(int i=2;i<=Math.sqrt(n);i++)
        {
            if(n%i==0)
            flag++;
        }
        if(flag==0)
        return true;
        else
        return false;
    }
    public static int findFactor(long n)
    {   int factor=1;
                  
        for(int i=2;i<=Math.sqrt(n);i++)
        {
            if(n%i==0)
            {
                factor=i;
            break;}
        }
        
        return factor;
    }
}