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

public class Solution {
    
    static long longestSequence(long[] a) {
        //  Return the length of the longest possible sequence of moves.
        long total = 0;
        for (int i = 0; i < a.length; i++) {
            total += getLargestNumberOfMoves(a[i]);
        }
        return total;
    }
    
    static long getLargestNumberOfMoves(long n) {
        double sqrt = Math.sqrt(n);
        long total = 1;
        
        for (long i = 2l; i < sqrt + 1; i++) {
            if (n % i == 0) {
                total += n;
                n = n / i;
                i--;
            }
        }
        
        if (n != 1) total += n;
        return total;
    }

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