#include <bits/stdc++.h>

using namespace std;

int n;
long long ans, ta, tb;
vector< long long > v;

int main() {
	scanf("%d", &n);
	while (n--) {
		scanf("%lld", &ta);
		tb = ta;
		v.clear();
		for (long long i = 2; i * i <= ta; i++)
			while (ta % i == 0) {
				ta /= i;
				v.push_back(i);
			}
		if (ta != 1)
			v.push_back(ta);
		reverse(v.begin(), v.end());
		ta = 1;
		for (int i = 0; i < v.size(); i++) {
			ans += ta;
			// printf("%lld %lld  %lld\n", ta, tb, v[i]);
			tb /= v[i];
			ta *= v[i];
		}
		ans += ta;
	}
	printf("%lld\n", ans);
	return 0;
}