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

public class Solution
{
    static int prime(long k)
    {
        int c=0;
        for(long i=1;i<=k;i++)
        {
            if(k%i==0)
                c++;
        }
        if(c==2)
            return 1;
        else
            return 0;  
    }
    
    
    static long gd(long k)
    {
        long r=k;
        for(long i=1;i<k;i++)
        {
            if(k%i==0)
                r=i;
        }
        return r;
    }
    
    static long longestSequence(long[] a)
    {
        long x,d,total=0,k;
        for(int i=0;i<a.length;i++)
        {
                x=a[i];
                if(prime(x)==1)
                {
                    total=total+x;
                }
                else
                {
                    d=gd(x);
                    total=total+d+x;
                    /*while(x!=0)
                    {
                        
                        total=total+x;
                        x=x/d;
                    }*/
                }
        }
        total++;
        return total;
        
    }

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        long[] a = new long[n];
        for(int i = 0; i < n; i++)
        {
            a[i] = in.nextLong();
        }
        long result = longestSequence(a);
        System.out.println(result);
        in.close();
    }
}