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 number = 0;
        for(int i = 0; i<a.length; i++){
            long temp = a[i];
            if(temp == 1){
               number += 1; 
            }else{
                long tempAnswer = 1;
                long tempCalc = tempAnswer;
                for(long j = temp; j>=2; j--){
                    while(temp % j == 0 && isPrime(j)){
                        tempCalc = tempCalc*j;
                        //System.out.println(j);
                        //System.out.println(tempCalc);
                        tempAnswer += tempCalc;
                        //System.out.println(tempAnswer);
                        temp = temp/j;
                        //System.out.println(temp);
                    }
                }
                number += tempAnswer;
            }
        }
        return number;
    }
    
    public static boolean isPrime(long n){
        // check lower boundaries on primality
        if( n == 2 ){ 
            return true;
        } // 1 is not prime, even numbers > 2 are not prime
        else if( n == 1 || (n & 1) == 0){
            return false;
        }

        // Check for primality using odd numbers from 3 to sqrt(n)
        for(int i = 3; i <= Math.sqrt(n); i += 2){
            // n is not prime if it is evenly divisible by some 'i' in this range
            if( n % i == 0 ){ 
                return false;
            }
        }
        // n is prime
        return true;
    }
    

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