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

public class Solution {
    static long ans = 0;
    
    static long longestSequence(long[] a) {
        //  Return the length of the longest possible sequence of moves.
       long ra = 0;
        for(int i=0;i<a.length;i++){
            //assert(a[i]<1000000);
            ans = 0;
            fun(a[i]);
            //System.out.println(a[i]+" => "+ans);
            ra += ans;
        }
        return ra;
    }
    
    static void fun(long n){
		if(n==1) ans = 1;
		else if(isPrime(n)){
			ans += n+1;
		}else{
			if(n%2==0){
				ans += n; 
				fun(n/2);
			}else{
				for(int i=3;i<=n;i+=2){
					if(n%i==0){
						ans += n;
						fun(n/i);
						break;
					}
				}
			}
		}
	}
    
    static boolean isPrime(long n){
        if(n==1) return false;
        if(n==2) return true;
        if(n%2==0) return false;
        for(long i=3;i<=Math.sqrt(n);i+=2){
            if(n%i==0) return false;
        }
        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();
            //System.out.println(a[a_i]);
        }
        long result = longestSequence(a);
        System.out.println(result);
        in.close();
    }
}