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

public class Solution {
    
    static long firstDivisor(long n) {
        for(int i = 2; i*i<=n; i++){
            if(n%i==0)
                return i;
        }
        return n;
    }
    
    static long longestSequence(long a) {
        if(a==1)
            return 1;
        
        long div = firstDivisor(a);
        
        return a + longestSequence(a/div);
    }

    static long longestSequence(long[] a) {
        long total = 0;
        for(int i = 0; i<a.length; i++){
            total+=longestSequence(a[i]);
        }
        
        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();
    }
}