#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mp make_pair
#define mod 1000000007
#define ff first
#define ss second
ll rec(ll);
ll n,a[101];
ll p[1000001];
vector<ll> v;
vector<pair<ll,ll> > global;
map<ll,ll> ans;
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	ll i,j,c,d,sum;
	for(i=2;i<=1000000;i++)
	{
	    if(p[i]!=0)
	    continue;
	    v.push_back(i);
	    p[i]=i;
	    for(j=i*i;j<=1000000;j+=i)
	    {
	        p[j]=i;
	    }
	}
	ans[1]=1;
	/*for(i=2;i<=1e6;i++)
	{
	    ans[i]=-1;
	    j=i;
	    while(j!=1)
	    {
	        ans[i]=max(ans[i],p[j]*ans[i/p[j]]+1);
	        j=j/p[j];
	    }
	}*/
	sum=0;
	cin>>n;
	for(i=0;i<n;i++)
	{
	    cin>>a[i];
	    c=a[i];
	    for(j=0;j<v.size();j++)
	    {
	        if(c%v[j]==0)
	        {
	            d=0;
	            while(c%v[j]==0)
	            {
	                c/=v[j];
	                d++;
	            }
	            global.push_back({v[j],d});
	        }
	    }
	    if(c>1)
        global.push_back({c,1});
        if(ans.find(a[i])==ans.end())
	    ans[a[i]]=rec(a[i]);
	    global.clear();
	    sum+=ans[a[i]];
	}
	cout<<sum<<"\n";
	return 0;
}


ll rec(ll num)
{
    ll i,c=-1;
    for(i=0;i<global.size();i++)
    {
        if(global[i].ss==0)
        continue;
        global[i].ss--;
        if(ans.find(num/global[i].ff)==ans.end())
        ans[num/global[i].ff]=rec(num/global[i].ff);
        global[i].ss++;
        c=max(c,global[i].ff*ans[num/global[i].ff]+1);
    }
    return c;
}