#include <iostream>
#include <cmath>
#include <queue>

using namespace std;

const long long MAX_A = 1000000000000;
const int MAX_N = 100;

long long len, sum;
int n;

long long breakStick(long long l)
{

	long long i = 2, r = sqrt(l), s = 1;
	queue<long long> pf;

	if (l == 1)
		return 1;

	while (i <= r && l != 1)
		if (l % i)
			i++;
		else {
			pf.push(i);
			l /= i;
		}
	if(l != 1)
		pf.push(l);
	
	while (!pf.empty()) {
		s *= pf.front();
		s += 1;
		pf.pop();
	}

	return s;

}

int main()
{
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> len;
		sum += breakStick(len);
	}
	cout << sum << endl;
	return 0;
}