#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
bool P[1000011];
deque<ll>primes;
ll ans(ll a)
{
	if (a == 1)
		return 1;
	ll ret = a + 1;
	if (a > 1000000)
	{
		ll x = a;
		for (ll i : primes)
			while (x % i == 0)
				x /= i;
		if (x > 1)
			return max(ret, 1 + x * ans(a / x));
	}
	for (ll i : primes)
	{
		if (a % i == 0)
		{
			return max(ret, 1 + i * ans(a / i));
		}
	}
	return ret;
}
long longestSequence(vector <long> a) {
	ll ret = 0;
	for (ll i : a)
		ret += ans(i);
	return ret;
}

int main() {
	for (ll i = 2; i < 1000011; i++)
		if (!P[i])
		{
			primes.push_front(i);
			for (ll j = i; j < 1000011; j += i)
				P[j] = true;
		}
	ll n;
	cin >> n;
	vector<long> a(n);
	for (ll a_i = 0; a_i < n; a_i++) {
		cin >> a[a_i];
	}
	long result = longestSequence(a);
	cout << result << endl;
	return 0;
}