/** source code by coolreshab **/

#include<bits/stdc++.h>
using namespace std;

#define MAX 100000
#define inf 1000000000
#define mod 1000000007
#define ll long long

unordered_map<ll,ll>dp;
vector<ll>fact;
ll solve(ll x)
{
    if(x==1)
        return 1;
    if(dp.count(x))
        return dp[x];
    ll ret=0;
    int i,len=fact.size();
    for(i=0;i<len;++i)
    {
        if(fact[i]==1)
            continue;
        if(x%fact[i]==0)
            ret=max(ret,1+(fact[i]*solve(x/fact[i])));
    }
    return dp[x]=ret;
}
int main()
{
    ios::sync_with_stdio(false);
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    int n,i;
    ll ans=0,x,j;
    cin>>n;
    for(i=1;i<=n;++i)
    {
        cin>>x;
        for(j=1;j*j<=x;++j)
        {
            if(x%j==0)
            {
                fact.push_back(j);
                if(j*j!=x)
                    fact.push_back(x/j);
            }
        }
        ans+=solve(x);
        fact.clear();
    }
    cout<<ans<<endl;
    return 0;
}