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 w) {
       int sum=0;
        for(int t=0;t<w;t++){
            int mul=1;
        double x=Math.sqrt(a[t]);
    	int k=(int)x;
    	long arr[]=new long[k];
            int n=0;
            while(a[t]%2==0) {
    		arr[n++]=2;
    		a[t]=a[t]/2;
    	}
            for(int i=3;i<=a[t];i=i+2) {
    		while(a[t]%i==0) {
    			arr[n++]=i;
    			a[t]=a[t]/i;
    		}
    	}
    	if(a[t]>2) {
    		arr[n++]=a[t];
    	}
            int count=0;
            for(int i=0;i<arr.length;i++){
                if(arr[i]!=0)
                    count++;
                else 
                    break;
            }
            long array[]=new long[count];
    	for(int i=0;i<count;i++) {
    		array[i]=arr[i];
    	}     
            for(int i=count-1;i>=0;i--){
    		mul*=array[i];
    		sum+=mul;
    	}
            sum+=1;;
        }
        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();
    }
}