#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

ll m, ans;

ll grd(ll number){
	long long div=2, ans = 0, maxFact;
    while(number!=0){
        if(number % div !=0)
            div = div + 1;
        else{
            maxFact  = number;
            number = number / div;

            if(number == 1){
    			return maxFact;
    //            printf("%d is the largest prime factor !",maxFact);
      //          ans = 1;
            }
        }
    }
    return 0;
}

long long pro(long long n){
	ll p, i =2, sq = sqrt(n);
	//cout << n << ' ';
	p = grd(n);
	if(p == n || !p) return n+1;
	return p * pro(n/p) + 1;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cin >> m;
	for (int i = 0; i < m; ++i)
	{
		ll a;
		cin >> a;
		if(a == 1) ++ans;
		else 
			ans += pro(a);
	}
	cout << ans;
}