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) {
        //  Return the length of the longest possible sequence of moves.
        long total=0;
        for(int i=0;i<N;i++){
            if(a[i]==1){
                total+=1;
            }
            else if(isPrime(a[i])){
                total+=a[i]+1;
            }
            else{
                total+=a[i];
                long k=1;
                while(k<a[i]){
                k = lowestDivider(a[i], k);
                total+=(a[i]/k);
                }
            }
        }
        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, n);
        System.out.println(result);
        in.close();
    }
    static boolean isPrime(long n) {
    if (n%2==0) return false;
    for(int i=3;i*i<=n;i+=2) {
        if(n%i==0)
            return false;
    }
    return true;
    }
    static long lowestDivider(long T, long factor_of_T){
        long k = factor_of_T;
        long c=2;

        while(T>=k*c)
        {
            if(T%(k*c)==0)
                return k*c;
            c++;
        }
        return -100000;
    }
}