#include <bits/stdc++.h>

using namespace std;

vector<long> factoring(long n){
    long cur = 2;
    vector<long> results;
    while(n > 1){
        if(n % cur == 0){
            n /= cur;
            results.push_back(cur);
        }else{
            cur++;
        }
    }
    return results;
}

long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
    int output = 0;
    int pieces = 0;
    vector<long> primes;
    for(int i = 0; i < a.size(); ++i){
        primes = factoring(a[i]);
        for(int j = 0; j < primes.size(); ++j){
            output += a[i];
            a[i] /= primes[j];
        }
        output++;
    }
    return output;
}

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