#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
template<class T>inline bool isPrime(T n){if(n<=1)return false;for(T i=2;i*i<=n;++i)if(n%i==0)return false;return true;}

int main() 
{  
    int n;
    cin >> n;
    long int ans=0;
    long int a;
    for (int i = 0; i < n; i++) 
    {
        cin >> a;
        if(a==1)
        {
            ans+=1;
        }
        else
        {
            if(isPrime(a))
            {
                ans+=(a+1);
            }
            else
            {
                
            }       
        }
    }
    cout<<ans<<endl;
    return 0;
}