#include <bits/stdc++.h>

using namespace std;

long longestSequence(vector <long> a) {
    //  Return the length of the longest possible sequence of moves.
    long ans=0,x=1,result=0,i,j,k,n,len;
    for(i=0;i<a.size();i++){
        n = a[i];
        vector<long>b;
        for(j=2;j*j<=n;j++){
            while(n%j==0){
                n = n/j;
                b.push_back(j);
            }
        }
        if(n>1)
            b.push_back(n);
        x=1;
        ans=0;
        for(k=b.size()-1;k>=0;k--){
            x = x*b[k];
            ans += x;
        }
        result+=ans;
        result++;
    }
    return result;
}

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