#include <bits/stdc++.h>

using namespace std;

long long primeFactors(long long n)
{	
	long long ans=1;
    // Print the number of 2s that divide n
    while (n%2 == 0)
    {
        ans *= 2;
		ans++;//printf("%d ", 2);
        n = n/2;
    }
 
    // n must be odd at this point.  So we can skip 
    // one element (Note i = i +2)
    for (long long i = 3; i <= sqrt(n); i = i+2)
    {
        // While i divides n, print i and divide n
        while (n%i == 0)
        {
            ans *= i;
			ans++;//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){
		ans *= n;
		ans++;
	}
	
	return ans;
}

int main() {
 
	int n;
	cin>>n;
	long long temp;
	long long ans=0;
	for(int i=0;i<n;i++){
		cin>>temp;
		if(temp==1){
			ans++;
		}
		else{
			//vector<long long> store;
			ans+= primeFactors(temp);
		}
	}
	cout<<ans;
	
    return 0;
}