#include <bits/stdc++.h>

using namespace std;

map<long,long> NDivisions;

long longestDivisions(long a){
    if(NDivisions.find(a)!=NDivisions.end()){
        return NDivisions[a];
    }
    if(a==1){
        return 1;
    }
    else{
        long res=1;
        for(long i=2;i<=a;i++){
            if(a%i==0){
                long r=1+i*longestDivisions(a/i);
                if(res<r){
                    res=r;
                }
            }
        }
        NDivisions[a]=res;
        return res;
    }
}

long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
    long n=a.size();
    long s=0;
    for(long i=0;i<n;i++){
        s=s+longestDivisions(a[i]);
    }
    return s;
}

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