#include <bits/stdc++.h>

using namespace std;

vector<long> primes;

long path(long n){
    long ret = 1;
    
    for (int i=0; i<primes.size(); ++i){
        long tmp = primes[i];
        if (n< tmp) break;
        while (!(n % tmp)){
            ret += n;
            n /= tmp;
        }
    }
    
    if (n!=1) ret += n;
    
    return ret;
}
long longestSequence(vector <long> &a) {
    //  Return the length of the longest possible sequence of moves.
    long ret = 0;
    for (vector<long>::iterator it=a.begin(); it!=a.end(); ++it){
        ret += path(*it);
    }
    return ret;
}

#define mm 1000001

int main() {
    int n;
    cin >> n;
    vector<long> a(n);
    
    // sieve
    bool isNotPrime[mm] = {};
    for (int c = 4; c<mm; c+=2){
        isNotPrime[c] = 1;
    }
    
    primes.push_back(2);
    
    for (int p=3; p<1000; p+=2){
        if (isNotPrime[p]) continue;
        
        primes.push_back(p);
        for (int c = p*p; c<mm; c+=p){
            isNotPrime[c] = 1;
        }
    }
    
    for (int p=1001; p<mm; p+=2){
        if (isNotPrime[p]) continue;
        primes.push_back(p);
    }
    // sieve ends
    
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    long result = longestSequence(a);
    cout << result << endl;
    return 0;
}