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

public class Solution {

        public static boolean isPrime(long n)
	{
	     if (n <= 1)  return false;
	    if (n <= 3)  return true;
	    if (n%2 == 0 || n%3 == 0) return false;
	 
	    for (long i=5; i*i<=n; i=i+6)
	        if (n%i == 0 || n%(i+2) == 0)
	           return false;
	 
	    return true;
	}
    
    static long  prime(long j){
        if(j%2==0)
            return (j + prime(j/2));
        else if(isPrime(j))
            return j+1;
        else if(j%2!=0){
            for(long i=2;i<j;i++){
              if(j%i==0) 
                  return (j+ prime(j/i));
            }
        }
        return 1;
    }
    static long longestSequence(long[] a) {
        //  Return the length of the longest possible sequence of moves.
        long j=0;
        for(int i=0;i<a.length;i++){
            if(a[i]>1)
        j+=prime(a[i]);
            else
                j+=a[i];
        }
        return j;
    }

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