//Code of C#oder Born_confused
#include <bits/stdc++.h>
using namespace std;

#define FOR(i,a,b) for(int i=a;i<b;++i)
#define FORD(i,a,b) for(int i=a;i>=b;--i)
#define pb push_back
#define mp make_pair
#define ll long long int
#define s(x) scanf("%d", &x)
#define sd(x) scanf("%lf", &x)
#define sl(x) scanf("%lld", &x)
#define mod 10000007
#define fi first
#define se second
#define p(x) printf("%d",x)
#define pl(x) printf("%lld", x)
#define pd(x) printf("%lf", x)
#define pn() printf("\n")
ll primeFactors(ll n)
{
    ll res=0;
    vector<ll>v;
    // Print the number of 2s that divide n
    while (n%2 == 0)
    {
    	v.pb(2);
        //printf("%d ", 2);
        n = n/2;
    }
 
    // n must be odd at this point.  So we can skip 
    // one element (Note i = i +2)
    for (ll i = 3; i <= sqrt(n); i = i+2)
    {
        // While i divides n, print i and divide n
        while (n%i == 0)
        {
        	v.pb(i);
            //printf("%d ", i);
            n = n/i;
        }
    }
 
    // This condition is to handle the case when n 
    // is a prime number greater than 2
    if (n > 2)
    {
    	v.pb(n);
        //printf ("%d ", n);
    }
    ll k=1;
    for(int i=v.size()-1;i>=0;i--)
    {
    	k=k*v[i];
    	res+=k;
    }
    return res+1;
}
int main()
{
	int n;
	cin>>n;
	ll a[n];
	for(int i=0;i<n;i++)
		sl(a[i]);
	ll ans=0;
	for(int i=0;i<n;i++)
	{
		ans+=primeFactors(a[i]);
	//	cout<<ans<<endl;
	}
	pl(ans);
	return 0;
}