#include <bits/stdc++.h>

using namespace std;

long leastDivisor(long L, unordered_map<long, long>& leastdiv){
    if(leastdiv.find(L) != leastdiv.end()){
        //cout<<"found save for "<<L<<endl;
        return leastdiv[L];   
    }
    if(L % 2 == 0){
        leastdiv[L] = 2;
        return 2;
    }else{
        int d = 3;
        while((L % d != 0) && (d < L/d) ) d+=2;
        if(L % d == 0)
            leastdiv[L] = d;
        else
            leastdiv[L] = L;
        return leastdiv[L];
    }
}
long stick(long L, unordered_map<long, long>& saved, unordered_map<long, long>& leastdiv){
    if(saved.find(L) != saved.end())
        return saved[L];
    long move = L;
    long oldL = L;
    //cout<<"move for "<<L <<" is ";
    while(L > 1){
        long d = leastDivisor(L, leastdiv);
        //cout<<"least divisor for " << L << " is "<< d ;
        if (saved.find(L / d) != saved.end()){
            move += saved[L / d];
            //cout<<"use existing number for " << L/d << "=" << saved[L / d]<< endl;
            break;
        }
        move += L / d;
        L = L / d;
        //cout<<" now move = " << move << ", L ="<< L << endl;
        
        
    }
    //cout<<move << endl;
    saved[oldL] = move;
    return move;
}
long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
    long move = 0;
    long moves = 0;
    unordered_map<long, long> save;
    unordered_map<long, long> leastdiv;
    
    leastdiv[1] = 1;
    leastdiv[2] = 2;
    leastdiv[3] = 3;
    for(int i = 0; i < a.size(); i++){
        move = stick(a[i], save, leastdiv);
        //cout<<"move for "<< a[i] <<"="<< move << endl;
        moves += move;
    }
    return 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;
}