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 retval = 0;
        
        for (int i = 0; i < a.length; i++)
        {
            retval += process(a[i]);    
        }
        
        return retval;
    }
    
    static long process(long num)
    {
        if (num == 1)
        {
            return num;
        }
        
        long retval = num;
        long current = checkPrime(num);
            
        while (current != -1)
        {
            num = num / current;
            retval += num;
            
            current = checkPrime(num);
        }
        
        return retval + 1;
    }
    
    static int checkPrime(long num)
    {
        for (int i = 2; i <= Math.sqrt(num); i++)
        {
            if (num % i == 0)
            {
                return i;
            }
        }
        
        return -1;
    }

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