#include <bits/stdc++.h>

using namespace std;

long findSeq(long n)
{
    //cout << n << endl;
    if(n == 1)
        return 1;
    else if(n % 2 == 0 & n >= 2)
        return 1 + findSeq(n / 2);
    else if(n % 3 == 0 && n >= 3)
        return 1 + findSeq(n / 3);
    else if(n % 5 == 0 && n >= 5)
        return 1 + findSeq(n / 5);
    else if(n % 7 == 0 && n >= 7) 
        return 1 + findSeq(n / 7);
    
    
    return n;
}

long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
    int sum = 0;
    for(int i = 0; i < a.size(); i++) 
    {
        /*if(a.at(i) % 2 == 0)
        {   
            int exp = 0;
            for(int j = a.at(i); j > 0; j -= 2)
            {
                exp++;
            }
            cout << "exp: " << exp << endl;
            sum += pow(2, exp);
            
            sum += 2;
        }
        else
            sum += (a.at(i) + 1);*/
        
        sum += a.at(i) + findSeq(a.at(i));
    }
    sum++;
    
    return sum;
}

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