#include <bits/stdc++.h>
using namespace std;

#define ll long long

const int N = 1e7 + 5;

bool prime[N];
vector<ll> primes;

void findPrimes() {
	for (int i = 2; i*i < N; i++) {
		if (prime[i] == false) {
			for (int j = i*i; j < N; j += i)
				prime[j] = true;
		}
	}

	for (int i = 2; i < N; i++)
		if (prime[i] == false)
			primes.push_back((ll)i);
}

int main() {
	int n; ll ans = 0;
	scanf("%d", &n);

	findPrimes();

	while (n--) {
		ll num;
		scanf("%lld", &num);

		vector<ll> v;

		for (ll p : primes) {

			if (p*p > num)
				break;
			
			while (num%p == 0) {
				num /= p;
				v.push_back(p);
			}

		}

		if (num > 1)
			v.push_back(num);

		ll temp = 1;
		ans++;

		for (int i = v.size() - 1; i >= 0; i--) {
			temp *= v[i];
			ans += temp;
		}
	}

	printf("%lld\n", ans);
}