#include <bits/stdc++.h>

using namespace std;

long handle(long x)
{
	long cnt = 0;
	long d = 2;
	while (d*d <= x) {
		while (x%d == 0) {
			cnt += x;
			x /= d;
		}
		d++;
	}
	cnt += (x > 1? x + 1: 1);

	return cnt;
}

long longestSequence(vector <long> a) {	
	long cnt = 0;
    for (long x : a) {
		cnt += handle(x);
	}
	return cnt;
}

int main() {
    int n;
    cin >> n;
    vector<long> a(n);
    for(int a_i = 0; a_i < n; a_i++){
       cin >> a[a_i];
    }
    long result = longestSequence(a);
    cout << result << endl;
    return 0;
}