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

public class Solution {

    static long longestSequence(long[] a,int n) {
        long totSum=0;
        for(int ai=0;ai<n;ai++){
            ArrayList<Long> al=new ArrayList<Long>();
            long temp=a[ai];
            for(long i=2;i<=temp;i++){
                if(temp%i==0){
                    do{
                        al.add(i);
                        temp=temp/i;
                    }while(temp%i==0);
                }
            }
            totSum=totSum+fn(al);
        }
        return totSum;
    }
    static long fn(ArrayList<Long> al){
        Collections.sort(al);
        int n=al.size();
        long sum=1;
        long np=1;
        for(int j=n-1;j>=0;j--){
            
            np=np*al.get(j);
            sum=sum+np;
        }
        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,n);
        System.out.println(result);
        in.close();
    }
}