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

public class Solution {

    static boolean isPrime(long num)
    {
        boolean flag=true;
        for(int i = 2; i <= Math.sqrt(a); ++i)
        {
            // condition for nonprime number
            if(num % i == 0)
            {
                flag = false;
                break;
            }
        }
        return flag;
    }
    static long longestSequence(long[] a) {
        //  Return the length of the longest possible sequence of moves.
        long moves=0;
        for(int i=0;i<a.length;i++)
        {
            long stick=a[i];
            if(a[i]==1)
                moves+=1;
            else if(isPrime(a[i])==true)
                moves+=a[i]+1;
            else
            {
                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();
    }
}