#include <math.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <assert.h>
#include <limits.h>
#include <stdbool.h>


int isPrime(int n)
{
    int i;
    
    if (n <= 1)  
        return 0;

    for (i=2; i<n; i++)
        if (n%i == 0)
            return 0;

    return 1;
}

long int longestSequence(int a_size, long int* a) {
   long int total;
    for(int i=0;i<a_size;i++){
        if(a[i]==1)
            total+=1;
        else
       if(isPrime(a[i]))
           total+=a[i]+1;
        else
            //if(isEven(a[i]))
                total+=a[i]+a[i]-2;
    }
    return total;
    //  Return the length of the longest possible sequence of moves.
}

int main() {
    int n; 
    scanf("%i", &n);
    long int *a = malloc(sizeof(long int) * n);
    for (int a_i = 0; a_i < n; a_i++) {
       scanf("%li",&a[a_i]);
    }
    long int result = longestSequence(n, a);
    printf("%ld\n", result);
    return 0;
}