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

#define ll long long
#define N 1000005
#define mod 1000000007
#define boost ios_base::sync_with_stdio(false);cin.tie(0)
#define prec(n) fixed<<setprecision(n)

#define pii pair<int,int> 
#define pll pair<ll,ll> 
#define fi first
#define se second
#define pb push_back
#define vi vector<int> 
#define vll vector<ll> 

ll modulo(ll num){ return ((num%mod)+mod)%mod;} // for negative integer
ll power(ll b,ll e,ll MOD=mod){ll ans=1; while(e){if(e%2) ans=(ans*b)%MOD; b=(b*b)%MOD; e/=2;} return ans;}

ll lp[N+1]={};
vector<ll> pr;

void prime_gen()
{
    
    for (ll i=2; i<=N; ++i)
    {
        if (lp[i] == 0) 
        {
            lp[i] = i;
            pr.push_back (i);
        }
        for (ll j=0; j<(ll)pr.size() && pr[j]<=lp[i] && i*pr[j]<=N; ++j)
            lp[i * pr[j]] = pr[j];
    }

}


int main() 
{
    boost;
    prime_gen();
    
    ll n,num,ans=0,i ;
    ll  si = pr.size();
    
    cin>>n;
    
    while(n--)
    {
        cin>>num;
        
        while(num>1)
        {
            ans+=num;
            if(num<N)
            {
                num/=lp[num];
            }
            else
            {
                for(i=0;i<si;i++)
                {
                    if(num%pr[i]==0)
                    {
                        num/=pr[i];
                        break;
                    }
                }
                if(i==si)
                num/=num;
            }
        }
        ans+=1;
    }
    
    cout<<ans<<endl;
    return 0;
}