/* ****Enigma27**** */

#include<bits/stdc++.h>
#define ll          long long
#define pb          push_back
#define	endl		'\n'
#define pii         pair<ll int,ll int>
#define vi          vector<ll int>
#define all(a)      (a).begin(),(a).end()
#define F           first
#define S           second
#define hell        1000000007
#define lbnd        lower_bound
#define ubnd        upper_bound
#define bs          binary_search
#define mp          make_pair
#define ios	    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll t,i,n,a[100];
int main()
{	//ios
	ll ans=0;
	cin>>n;
	for(ll p=0;p<n;p++){
		vi v;
		cin>>t;
		ll temp=t;
		for(ll i=2;i<=sqrt(t);i++){
			if(temp%i==0){
				v.pb(i);
				while(temp%i==0) temp/=i;
			}
		}
		v.pb(temp);
		v.pb(1);
		i=0;
		while(t>1){
			if(t%v[i]!=0) i++;
			ans+=t;
			t/=v[i]; 
		}
		ans++;
		v.clear();
	}	
	cout<<ans<<endl;
	return 0;
}