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.
        ArrayList<Long>[] prime = (ArrayList<Long>[])new ArrayList[n];
        long sum = 0;
        for(int i = 0; i < a.length; i++){
            prime[i] = new ArrayList<Long>();
            long o = a[i];
                        
            for(long k = 2; k <= o; k++){
                while(o%k == 0){
                    prime[i].add(k);
                    o /= k;
                    
                }
            }
        
      // for (int b : prime)
       //     System.out.println(b);
        long answ = 1;
        long temp = 1;
       
        for(int j = prime[i].size() - 1; j >= 0; j--){
            
           // System.out.println(prime.size());
            temp *= prime[i].get(j);
            answ += temp;
           // System.out.println(temp + " " + answ);
        }
            sum += answ;
        }
        return sum;
    }

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