#include <bits/stdc++.h>

using namespace std;

const int N = 110;

int n;
long long a[N];

long long calc(long long x){
	vector < pair < long long, int > > fact;

	long long tmp = x;

	for(long long i = 2; i * i <= x; ++i){
		if(tmp % i == 0){
			fact.emplace_back(i, 0);
			while(tmp % i == 0){
				++fact.back().second;
				tmp /= i;
			}
		}
	}
	if(tmp > 1){
		fact.emplace_back(tmp, 1);
	}

	long long now = 1, ans = x;

	sort(fact.begin(), fact.end());

	for(auto p : fact){
		while(p.second--){
			now *= p.first;
			ans += x / now;
		}
	}
	return ans;
}

int main(){
	if(fopen("1.inp", "r")){
		freopen("1.inp", "r", stdin);
	}

	int n;
	long long ret = 0;

	cin >> n;
	for(int i = 1; i <= n; ++i){
		cin >> a[i];
		ret += calc(a[i]);
	}

	cout << ret;

	return 0;
}