#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll isPrime(ll n)
{
    ll count=0;
    for(ll i = 2; i*i <= n; i++)
    {
        if(n%i == 0)
        {
            count = 1;
            break;
        }
    }
    if(count==1)
    {
        return 0;
    }
    else
    {
        return 1;
    }
}
ll Least(ll n)
{
	ll r;
    for(ll i = 2; i < n; i++)
    {
        if(n%i == 0)
        {
            r = i;
            break;
        }
    }
    return r;
}
ll Getsum(ll n)
{
	
	if(n == 0)
    {
		return 0;
	}
    if(n == 1)
    {
        return 1;
    }
	else if(isPrime(n))
    {
		return n + 1;
	}
	else if(n%2 != 0)
    {
		ll d = Least(n);
		return Getsum(n/d) + n;
	}
	else
    {
		return Getsum(n/2) + n;
	}
}
int main()
{
	ll n, i, ans = 0, arr[1000006];
	cin >> n;
	for(i = 0; i < n; i++)
    {
		cin >> arr[i];
	}
	for(i = 0; i < n; i++)
    {
		ans = ans + Getsum(arr[i]);
	}
	cout << ans << endl;
	return 0;
}