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) {
        long ans = 0;
        for(int i =0 ;i < n; i++){
            if(a[i]!=1){
                ans += findans(a[i]);
            }else{
                ans ++;
            }
            
        }
        //  Return the length of the longest possible sequence of moves.
		return ans;
    }

    private static long findans(long l) {
		// TODO Auto-generated method stub
        if(l == 1){
            return 1;
        }
    	else if(l % 2 == 0){
            return l+findans(l/2);
        }else if(factoroflowestprime(l) == l){
    		return l + 1;
    	}else{
    		return l+findans(factoroflowestprime(l));
    	}
	}

	private static long factoroflowestprime(long num) {
		// TODO Auto-generated method stub
	    for (int i=3;i<=Math.sqrt(num);i+=2)
	    {
	        if (num%i==0)
	               return(num/i);
	    } 
		return num;
	}

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

}