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

public class Solution {
   static long func(long num)
    {
        long n = num;
        int i;
        for(i = 2; i<=n; i++)
            {
                if(n%i==0)
                {
                    n=n/i;
                    i--;
                }
                if(i>Math.sqrt(num))
                    return n;
            }
        return i;
    }

    static long longestSequence(long[] a) {
        long sum = 0 ;
        for(int i = 0; i<a.length; i++)
        {
            long locsum=1;
            long last = 1;
            long fact = func(a[i]);
            if (fact==a[i])
            {
                locsum = 1+a[i];
            }
            else{
            while(a[i]>1)
            {
                locsum=locsum + (long)fact*last;
                a[i]=a[i]/fact;
                last = (long)fact*last;
                fact= func(a[i]);
            }   
            }
            sum=sum+locsum;
        }
        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);
        System.out.println(result);
        in.close();
    }
}