#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define INF 1e18
#define pb push_back
#define F first
#define S second
#define ll long long
#define pi pair<ll,ll>
#define sc(x) scanf("%lld",&x)
ll prime[1000010];
ll ansp[1000010];
unordered_map<ll,ll> m;
vector<ll> primenum;
void preprocess(){
	for(int i=1;i<=1000000;i++){
		prime[i]=i;
	}
	for(int i=2;i<=1000000;i++){
		if(prime[i]==i){
			primenum.push_back(i);
			for(int j=2*i;j<=1000000;j+=i){
				prime[j]=i;
			}
		}
	}
	ansp[1]=0;
	for(ll i=2;i<=1000000;i++){
		ansp[i]=1+prime[i]*(ansp[i/prime[i]]);
	}
}
ll process(ll val){
	if(val<=1000000){
		return ansp[val];
	}
	if(m[val]){
		return m[val];
	}
	for(ll i=0;i<primenum.size() && primenum[i]*primenum[i]<=val;i++){
		if(val%primenum[i]==0){
			return m[val]=((val/primenum[i])+process(val/primenum[i]));
		}
	}
	return m[val]=1;
}
int main(){
	ll n,temp;
	sc(n);
	preprocess();
	ll ans=0;
	for(int i=0;i<n;i++){
		sc(temp);
		ans+=temp;
		ans+=process(temp);
	}
	printf("%lld\n",ans);
}