#include <bits/stdc++.h>

using namespace std;

long seq(long n) {
    if(n==1){
        return 0;
    }
    return n/2+seq(n/2);
}

int isprime(long n) {
    if(n==1)
        return 0;
    for(int i=2;i<=n/2;i++) {
        if(n%i==0)
            return 0;
    }
    return 1;
}

long longestSequence(vector <long> a) {
    int len=0;
    for(int i=0;i<a.size();i++) {
        if(!isprime(a[i]))
            len+=a[i]+seq(a[i]);
        else
            len+=a[i]+1;
    }
    return len;
    //  Return the length of the longest possible sequence of moves.
}

int main() {
    int n;
    cin >> n;
    vector<long> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    long result = longestSequence(a);
    cout << result << endl;
    return 0;
}