#include <bits/stdc++.h>

using namespace std;

void facPrime(unsigned long long n, vector<unsigned long long>& fac)
{
	while (n % 2 == 0)
	{
		n = n / 2;
		fac.push_back(2);
	}

	for (int i = 3; i <= sqrt(n); i = i + 2)
	{
		while (n % i == 0)
		{
			fac.push_back(i);
			n = n / i;
		}
	}

	if (n > 2)
	{
		fac.push_back(n);
	}
}

long longestSequence(vector <unsigned long long> a) {

	long res = 0;
	for (auto val : a)
	{
		vector<unsigned long long> fac;
		facPrime(val, fac);
		int s = fac.size();
		long res1 = 0;
		if (s > 0)
		{
			auto rit = fac.rbegin();
			long long last = *rit;
			res1 = *rit;
			++rit;
			for (; rit != fac.rend(); ++rit)
			{
				last *= *rit;
				res1 += last;
				//cout << res << endl;
			}
		}
		
		res1 += 1;
		res += res1;
	}
	return res;
}

int main() {
    int n;
    cin >> n;
    vector<unsigned long long> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    long result = longestSequence(a);
    cout << result << endl;
    return 0;
}