#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD 1000000007
ll n,a[105],ans;
map<ll,ll>mp;
map<ll,ll>::iterator it;
/*ll solve(ll num)
{
    if(num==1)
    return 1;
    else if(mp.count(num))
    return mp[num];
    else
    {
        ll val=num+1,i;
        for(i=2;i<=sqrt(num);i++)
        {
            if(num%i==0)
            {
                ll j=num/i;
                val=max(val,1+j*solve(i));
                val=max(val,1+i*solve(j));
            }
        }
        return mp[num]=val;
    }
}*/
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    ll i,j,k;
    cin>>n;
    for(i=1;i<=n;i++)
    {
        cin>>a[i];
        ans+=a[i];
        ll cur=a[i];
        mp.clear();
        for(j=2;j<=sqrt(a[i]);j++)
        {
            if(a[i]%j==0)
            {
                while(a[i]%j==0)
                {
                    a[i]/=j;
                    mp[j]++;
                }
            }
        }
        if(a[i]>1)
        mp[a[i]]++;
        for(it=mp.begin();it!=mp.end();it++)
        {
            j=it->first;//divisor
            k=it->second;//count
            //cout<<j<<" "<<k<<"\n";
            while(k--)
            {
                ans+=(cur/j);
                //cout<<cur/j<<"\n";
                cur/=j;
            }
        }
    }
    cout<<ans<<"\n";
    return 0;
}