#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
bool isprime(ll p){
	ll j=2;
	while(j<=sqrt(p)){
		if(p%j==0)
		return false;
		j++;
	}
	return true;
}
ll oddp(ll p){
	ll j=2;
	while(j<=sqrt(p)){
		if(p%j==0)
			return j;
		j++;
	}
	return 0;
}
ll primefactors(ll n){
    ll r=n;
     vector<ll> res;	
     while (n%2 == 0)
    {
	res.push_back(2);
        n = n/2;
    }
 
    for (ll i = 3; i <= sqrt(n); i = i+2)
    {
        while (n%i == 0)
        {
	    res.push_back(i);
            n = n/i;
        }
    }
    if (n>2)
	res.push_back(n);
    ll fin=0;
     ll q[res.size()];
	q[res.size()-1]=res[res.size()-1];
    for(ll i=res.size()-2;i>=0;i--){
	q[i]=q[i+1]*res[i];
    } 
    q[0]=1;
    for(ll i=0;i<res.size();i++)
	//cout<<res[i];
	fin+=q[i];
    
    return fin+r;	
	
}
int main()
{
ll n;
cin>>n;
ll a[n];
for(ll i=0;i<n;i++){
cin>>a[i];
}
ll ans=0;
for(ll i=0;i<n;i++){
	ll p =a[i];
	if(p==1){
		ans+=1;
		continue;
	}
	else if(isprime(p))
	ans+=(p+1);
	else if(p%2==1){
		ans+=primefactors(p);
		/*ll t = oddp(p);
		p = p/t;
		ans+=(p+1);
		ans+=a[i];*/
	}
	else if(p%2==0){
		ans+=primefactors(p);
	}
	
}
cout<<ans;

return 0;
}