#include <bits/stdc++.h>
using namespace std;
long get(long a,vector <long> vect,long i)
{
    if(a==1)
        return 1;
    else
    {
        return vect[i]*(get(a/vect[i],vect,i-1))+1;
    }
}

long longestSequence(vector <long> a) {
    long sum=0;
    for(int i=0;i<a.size();i++)
    {
        long n=a[i];
        vector <long> vect;
        while (n%2 == 0)
        {
            vect.push_back(2);
            n = n/2;
        }
        for (long i = 3; i <= sqrt(n); i = i+2)
        {
            while (n%i == 0)
            {
                vect.push_back(i);
                n = n/i;
            }
        }
        if (n > 2)
            vect.push_back(n);
        sort(vect.begin(),vect.end());
        long ans=get(a[i],vect,vect.size()-1);
        sum+=ans;
    }
    return sum;
}

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