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

#define ll long long
#define sd(x) scanf("%d", &(x))
#define vi vector<int>
#define pb push_back
vi primes;
const int N = 1e6;
int factor[N], mu[N];
void pre(){
    for(int i = 2;i*i<N;i++) if(!factor[i]) for(int j = i*i;j<N;j+=i) factor[j] = i;
    for(int i = 2;i<N;i++) if(!factor[i]) primes.pb(i), factor[i] = i;
    mu[1] = 1;
    for(int i = 2;i < N; i++){
    	int p = factor[i], x = i/p;
    	mu[i] = (x % p == 0) ? 0 : -mu[x];
    }	
}
ll ans(ll n){
	if(n == 1) return 1;
	ll curr = 1, ret = n;
	for(ll p : primes){
		if(p * p > n) break;
		if(n % p == 0){
			while(n % p == 0){
				n /= p;
				ret += n;
			}
		}
	}
	if(n != 1){
		ll p = n;
		while(n % p == 0){
			n /= p;
			ret += n;
		}
	}
	return ret;
}

int main(){
	pre();
	int n;
	cin >> n;
	long long Ans = 0;
	for(int i = 1; i <= n; i++){
		ll x;
		cin >> x;
		Ans += ans(x);
	}
	cout << Ans << endl;
	return 0;
}