#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i,a,b) for(ll i=a;i <= b;i++)
#define fast_io ios_base::sync_with_stdio(false)
#define pb push_back
#define fir first
#define sec second
#define tr(it,x) for(it = x.begin();it != x.end();it++)
#define mp make_pair
#define sz(x) x.size()
#define rep(i,n) for(ll i=0;i<n;i++)
#define double long double
#define accuracy ll precision = numeric_limits<double>::digits10
#define N 1000005
#define M 105

ll n,a[M],ans;
bool notPri[N];
vector<ll> pri;

void pre() {
	notPri[0] = true; notPri[1] = true;
	fr(i,2,N-1) {
		if(notPri[i]) continue;
		else pri.pb(i);
		for(int j = 2*i;j < N;j += i) {
			notPri[j] = true;
		}
	}
}

int main() {
	// freopen("input.txt", "r", stdin); 
	// freopen("output.txt", "w", stdout);
	fast_io;	 
	accuracy;
	pre();
	cin >> n;
	fr(i,1,n) {
		ll temp,tem = 1,z; cin >> temp;
		z = temp;
		vector<ll> st;
		rep(j,sz(pri)) {
			if(temp == 1) break;
			else {
				while(temp % pri[j] == 0) {
					st.pb(pri[j]);
					temp /= pri[j];
				}
			}
		}
		if(temp != 1) st.pb(temp);
		reverse(st.begin(),st.end());
		ans += tem;
		rep(j,sz(st)) {
			tem *= st[j];
			ans += tem;
		}
		assert(tem == z);
	}
	cout << ans << "\n";
}