#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define Maxm 10000007

//map<ll, ll> dp;

/*void precompute()
{
    dp[0]=0;
    dp[1]=1;
    for(ll i=2;i*i<MAX;i++)
    {
        if(dp[i]==0) dp[i]=1+i;
        for(ll j=2*i;j<1e5;j+=i)
        {
            dp[j]=max(dp[j],1+(dp[i]*(j/i)));
        }
    }
    
}*/

vector<ll> primes;
ll sp[Maxm]={0};

void precompute()
{
    for(ll i=1;i<Maxm;i++){
		sp[i]=i;
	}

	for(ll i=2;i<Maxm;i++){
		if(sp[i]==i){
			for(ll j=2*i;j<Maxm;j+=i){
				sp[j]=min(i,sp[j]);
			}	
		}
	}
	
	for(int i=2;i<Maxm;i++){
	    if(sp[i]==i){
	        primes.push_back(i);
	    }
	}
}

ll solveQuery(ll x)
{
    ll result=0;
    if(x>Maxm)
    {
        ll prm=x;
        ll k=0;
        while(x>Maxm&&k<primes.size())
        {
            if(x%primes[k]==0)
            {
                result+=x;
                x=x/primes[k];
                k=0;
            }
            k+=1;
        }
        if(prm==x) return x+1;
        while(1)
        {
            result+=x;
            if(x==1) break;
            x=x/sp[x];
        }
        return result;


    }
    else
    {
        while(1)
        {
            result+=x;
            if(x==1) break;
            x=x/sp[x];
        }
        return result;
    }
}



int main()
{
    precompute();
    int n;
    cin>>n;
    ll a[n];
    ll ans=0;
    for(int i=0;i<n;i++)
    {
        //cout<<sp[i]<<">>"<<sp[i+20]<<endl;
        cin>>a[i];
        ans+=solveQuery(a[i]);
    }
    cout<<ans<<endl;
    return 0;
}