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

public class Solution {

    static long longestSequence(long[] a) {
       long sum=0;
        
        for (int i=0; i<a.length;i++)
        {long z=a[i];
         if (z==1) {sum+=1; continue;}
        
         sum+=z;
        long thresh=(long)Math.sqrt(z);
        int x=2;
        while (true){
            if (z==1 || x>thresh) {
                sum+=1; break;}
        if (z%x==0){
            sum+=z/x;
            z=z/x;
            thresh=(long)Math.sqrt(z);
            continue;}
        x++;
        }
        
        }
        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();
        }
       
        System.out.println(longestSequence(a));
        in.close();
    }
}