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

public class Solution {
    static long ct=0;
    static long longestSequence(long[] a) {
        long g=0;
        int l=a.length;
        for(int i=0;i<l;i++)
        {
            long u=a[i];
            ct=ct+u;
            if(u!=1)
            {
                ct++;
            }
            for(int k=2;k<u;k++)
            {
                if(u%k==0)
                {
                    ct=ct+(u/k);
                    u=u/k;
                    k=1;
                }
            }
            
        }
        return(ct);
        //  Return the length of the longest possible sequence of moves.
    }

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