#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cctype>
#include<cstdlib>
#include<algorithm>
#include<bitset>
#include<vector>
#include<list>
#include<deque>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<sstream>
#include<fstream>
#include<iomanip>
#include<ctime>
#include<complex>
#include<functional>
#include<climits>
#include<cassert>
#include<iterator>
#include<unordered_set>
#include<unordered_map>
using namespace std;

int n;

int main() {
	cin >> n;
	long long int ans = 0;
	for (int i = 0; i < n; i++) {
		long long int a;
		scanf("%lld", &a);
		long long int num = a;
		vector<long long int> v;
		for (long long int i = 2; i*i <= a; i++) {
			while (a%i == 0LL) {
				v.push_back(i);
				a /= i;
			}
		}
		if(a>1)v.push_back(a);
		long long int way = 1;
		ans++;
		reverse(v.begin(), v.end());
		for (int i = 0; i < v.size(); i++) {
			way *= v[i];
			ans += way;
		}
	}
	printf("%lld\n", ans);
	return 0;
}