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

public class Solution {

    static long longestSequence(long[] a, int n) {
        long lseq = 0;
        for(int i = 0; i < n; i++){
            long x = 2;
            lseq += a[i];
            while(a[i] > 1){
                if(a[i] % x == 0){
                    a[i] = a[i]/x;
                    lseq += a[i];
                    x = 2;
                }
                else{
                    x++;
                }
            }
        }
        return lseq;
    }

    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, n);
        System.out.println(result);
        in.close();
    }
}