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 moves = 0;
        for (int i = 0; i < a.length; i++) {
            long curr = a[i];
            for (long n = a[i] - 1; n > 0; n--) {
                if (curr % n == 0) {
                    curr = n;
                    moves += curr;
                }
            }
            moves += a[i];
        }
        return moves;
    }

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