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

public class Solution {

    static long highestFactor(long n) {
        for(long i = n/2; i >= 1; i--) {
            if(n % i == 0) {
                return i;
            }
        }
        return 1;
    }
    
    static long longestSequence(long[] a) {
        //  Return the length of the longest possible sequence of moves.
        long result = 0;
        for(int i = 0; i < a.length; i++) {
            long p = a[i];
            while(p != 1) {
                //System.out.println(p);
                result += p;
                p = highestFactor(p);
            }
            result += p;
        }
        return result;
    }

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