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++){            
            if(a[i]==1)
                sum+=1;
            else{
                long n=a[i];
                Vector b=new Vector();
                while(n%2==0){
                    b.add(2);
                    n=n/2;
                }
                for(int j=3;j<=Math.sqrt(n);j=j+2){
                    while(n%j==0){
                        b.add(j);
                        n=n/j;
                    }
                }               
                if(n>2)
                    b.add(n);               
                sum+=1;long temp=1;
                for(int j=b.size()-1;j>=0;j--){
                    temp=temp*Long.parseLong((b.get(j)).toString());
                    sum+=temp;
                }
            }
        }
        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();
    }
    
}