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

#define ll unsigned long long int
#define fi first
#define se second
#define vi vector<ll>
#define pii pair<ll,ll>
#define vpi vector<pii>
#define rep(i,n) for(ll i=0;i<n;i++)
#define repA(i,a,n) for(ll i=a;i<=n;i++)
#define repD(i, a, n)  for(ll i = a; i >= (n); --i)
#define all(x) x.begin(), x.end()
#define fill(a)  memset(a, 0, sizeof (a))
#define pb push_back
#define MOD 1000000007

vi a;
vi primes;

void prime(ll n){

	ll i=0,start=n;
    ll cur=primes[0];
	while(cur<start){
		while(n%cur==0){
			a.pb(cur);
			n/=cur;
		}
        if(pow(cur,2)>start && start%cur==0) break;
		if(n==1) break;
        i++;
        if(i>=primes.size()){
        	a.pb(n);
        	break;
        }
        cur=primes[i];
	}
}

void SieveOfEratosthenes(ll n)
{
    vector<bool> pr(n+1,true);
    for (ll p=2; p*p<=n; p++)
    {
        // If prime[p] is not changed, then it is a prime
        if (pr[p] == true)
        {
            // Update all multiples of p
            for (ll i=p*2; i<=n; i += p)
                pr[i] = false;
        }
    }
 
    // Print all prime numbers
    for (ll p=2; p<=n; p++)
       if (pr[p])
          primes.pb(p);
}

int main() {
	ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    ll t,i,j;cin>>t;
    ll k=t;
    ll netsum=0;
    vi que;
    map<ll,ll> old;
    SieveOfEratosthenes(1000001);
    rep(j,t){
    	ll n;cin>>n;
    	a.clear();
    	prime(n);
        //rep(i,10)cout<<a[i]<<endl;
    	ll sum=1,pro=1;
        ll s = a.size();
        if(s>1){
            sort(all(a));
            repD(i,s-1,1){
    	       pro*=a[i];
    	       sum+=pro;
    	   }
        }
    	sum+=n;
    	if(n==1) sum=1;
    	netsum+=sum;
    }
    cout<<netsum<<endl;
    
    return 0;
}