#include <bits/stdc++.h>

using namespace std;
bool isprime(long n)
{
    long r=sqrt(n);
    for(int i=2;i<=r;i++)
    {
        if(n==1)
            return false;
        if(n%i==0)
            return false;
    }
    return true;
}
long longestSequence(vector <long> a) {
    long count=0,var=0,tot,p=1;
    for(int i=0;i<a.size();i++)
    {
        p=1;
        tot=a[i];
        label:
        {
        if(a[i]!=1)
        {
        for(int j=2;j<=a[i];j++)
        {
            if(isprime(j))
            {
                if(a[i]%j==0)
                {
                    var=j;
                }
            }
        }
        if(var==0)
            count+=a[i]+1;
        else
        {
            count+=p;
            a[i]/=var;
            p*=var;
            goto label;
        }
        }
        else
            count+=tot;
        }
    }
    return count;
    //  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;
}