#include <bits/stdc++.h>
#define lli long long int
#define pb push_back

using namespace std;

vector<lli> primes;
bool visited[1000010];

void seive()
{
    lli i,j;
	memset(visited , 0 , sizeof visited);
	for(i=2;i<1000010;i++)
	{
		if(visited[i])
			continue;
		primes.pb(i);
		visited[i] = 1;
		for(j=2;j<(1000010/i);j++)
		{
			visited[i*j] = 1;
		}
	}
	
}

lli get_ans(lli n)
{
	lli total = 0;
    
    if(n == 1)
        return 1;
	
	while(n != 0)
	{
		if(n % 2 == 0)
		{
			total += n;
			n/=2;
		}else
		{
			lli i = 0,j = -1;
			while(i<primes.size() && primes[i] <= sqrt(n))
			{
				if(n % primes[i] == 0)
				{
					j = primes[i];
					break;
				}
				i++;
			}
			if(j == -1)
			{
				total += n;
				n = 1;
			}else{
				total += n;
				n = n/j;
			}
		}
		if(n == 1)
		{
			total += 1;
			n = 0;
		}
	}
	
	
	return total;
}




long longestSequence(vector <lli> a) {
	
	lli ans = 0,i;
	for(i=0;i<a.size();i++)
		ans += get_ans(a[i]);
	
    return ans;
}

int main() {
	seive();
	//cout<<get_ans(6)<<endl;
	
    lli n;
    cin >> n;
    vector<lli> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    lli result = longestSequence(a);
    cout << result << endl;
    return 0;
	
}