import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {
    
    private static boolean isPrime(long num) {
        if (num % 2 == 0) return false;
        for (long i = 3; i * i < num; i += 2)
            if (num % i == 0) return false;
        return true;
    }
    public static long iOutput(long n)
    {
        if(n==1)
        {
            return 1;
        }
        if(isPrime(n))
        {
            return 1+n;   
        }
        if(n%2==0)
        {
            return (n + iOutput(n/2));
        }
        for (long i = 3; i <= n; i+= 2)
        {
            if (n%i == 0)
            {
                return (n+iOutput(n/i));
            }
        }
        return 1;
    }
        
    static long longestSequence(long[] a) {
        int len = a.length;
        long sum=0;
        for(int i=0;i<len;i++)
        {
            sum= sum + iOutput(a[i]);         
        }      
        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);
        System.out.println(result);
        in.close();
    }
}