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 sequence = 0;
        for (long num : a) {
            int j = 2;
            while(true){
                sequence += num;
                if(num==1) break;
                for (int i = j; i <= num; i++) {
                    if (num % i == 0) {
                        num = num / i;
                        break;
                    }
                }
            }
        }
        return sequence;
    }

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