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

public class Solution {
    static boolean isPrime(Long a)
    {
        if(a < 2) return false;
        if(a==2) return true;
        if(a%2==0) return false;
        for(int i=3;i*i<=a;i += 2){
            if(a%i==0) return false;
        }
        return true;
     
    }
    static long longestSequence(long[] a) {
        long res = 0;
        
        for(int i=0;i<a.length;i++){
            if(a[i]>1){
                 if(a[i]%2==0) res += (2*a[i])-2;
                 else if(isPrime(a[i])) res+= a[i]+1;
                 else res += a[i]+3;
           }
            else res += a[i];
        }
        return res;
        //  Return the length of the longest possible sequence of moves.
    }

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