#include <bits/stdc++.h>

using namespace std;
bool b[1000005];
vector<int> p;
void prime(int n)
{
    int i,j;
    for(i=2;i<n/i;i++)
        if(!b[i])
            for(j=i*i;j<=n;j+=i)
                b[j]=1;
    for(i=2;i<=n;i++)
        if(!b[i])
            p.push_back(i);
}
long longestSequence(vector <long> a) {
    prime(1000000);
    long i,an=0,x,t;
    while(!a.empty())
    {
        t=1;
        x=a.back();
        a.pop_back();
        for(i=0;i<p.size()&&x!=1;i++)
        {
            while(x!=1&&x%p[i]==0)
            {
                x/=p[i];
                t=t*p[i]+1;
            }
        }
        if(x!=1)
            t=t*x+1;
        an+=t;
    }
    return an;
    //  Return the length of the longest possible sequence of 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;
}