#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define se second
#define fi first
#define pb push_back
const int N=1e6 + 5;

int main(){

//	freopen("in.txt","r",stdin);

	int t;
	ll ans=0;
	scanf("%d",&t);
	while(t--){
		ll n;
		scanf("%lld",&n);
		vector<pair<ll, int> > d;
		vector<ll> temp;
		ll x=n,am=n;
		ans += n;
		for(ll i=2;i * i <= x;i++){
			int c=0;
			while(n % i == 0){
				c++;
				n/=i;
			}
			if(c){
				d.pb({ i, c });
			}
		}
		if(n != 1) d.pb({ n, 1 });
		for(int i=d.size() - 1;i >= 0;i--){
			while(d[i].se){
				x/=d[i].fi;
				temp.pb(x);
				d[i].se--;
			}
		}
		ll st=1;
		for(int i=0;i < temp.size();i++){
			ans+=st;
			st=st * (am / temp[i]);
			am=temp[i];
		}
	}
	cout << ans << endl;
	return 0;
}