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

public class Solution {
    public static long getFactor(long n){
        long i;
        for(i=n-1;i>0;i--){
            if(n%i==0)
                break;
        }
        return(i);
    }
    static long longestSequence(long[] a) {
        //  Return the length of the longest possible sequence of moves.
        long grand=0;
        for(int i=0;i<a.length;i++){
            long n=a[i];
            long num=0;
            long sum=n;
            do{
                num=getFactor(n);
                n=num;
                sum+=n;
            }while(n>1);
            grand=grand+sum;
        }
        return(grand);
    }

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