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 t=0;
        for(long ai : a) {
            t+=ai;
            for(long i=2; ai>1; ++i) {
                while(ai%i==0) {
                    ai/=i;
                    t+=ai;
                }
                if(i>=1e6) {
                    ++t;
                    break;
                }
            }
        }
        return t;
    }

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