#include<bits/stdc++.h>
#define ll long long int
using namespace std;
vector < ll > x;
map < ll , ll > g;
ll fun( ll num ,ll orig_num)
{
    if(g[num]!=0)
        return ((orig_num/num)*g[num]);
    else
    {
        ll maxi=-1;
        for(ll i=0;x[i]!=num;i++)
        {
            if(num%x[i]==0)
            {
            ll cat=fun(x[i],num);
            maxi=max(maxi,cat);
            }
        }
        g[num]=maxi+1;
        return ((orig_num/num)*g[num]);
    }
}
int main()
{
    g[1]=1;
    ll n;
    scanf("%lld",&n);
    ll a[102];
    for(ll i=0;i<n;i++)
        scanf("%lld",&a[i]);
    ll ans=0;
    for(ll j=0;j<n;j++)
    {
    for(ll i=1;i*i<=a[j];i++)
    {
        if(a[j]%i==0)
        {
            if(a[j]/i==i)
            {
                x.push_back(i);
            }
            else
            {
                x.push_back(i);
                x.push_back(a[j]/i);
            }
        }
    }
    sort(x.begin(),x.end());
    ans+=fun(a[j] , a[j]);
    x.clear();
    }
    printf("%lld",ans);
    return 0;
}