/*input
1
24
*/
/*
       _==/          i     i          \==_
     /XX/            |\___/|            \XX\
   /XXXX\            |XXXXX|            /XXXX\
  |XXXXXX\_         _XXXXXXX_         _/XXXXXX|
 XXXXXXXXXXXxxxxxxxXXXXXXXXXXXxxxxxxxXXXXXXXXXXX
|XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX|
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
|XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX|
 XXXXXX/^^^^"\XXXXXXXXXXXXXXXXXXXXX/^^^^^\XXXXXX
  |XXX|       \XXX/^^\XXXXX/^^\XXX/       |XXX|
    \XX\       \X/    \XXX/    \X/       /XX/
       "\       "      \X/      "      /"

*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
//loops
#define f(i,s,n) for(ll i=(ll)s;i<(ll)n;i++)
#define rf(i,n,s) for(ll i=(ll)(n-1);i>=(ll)s;i--)
//reset
#define ms0(X) memset((X), 0, sizeof((X)))
#define ms1(X) memset((X), -1, sizeof((X)))
//IO
#define bio ios_base::sync_with_stdio;cin.tie(NULL)
//STL
#define pb push_back
#define pii pair<ll,ll>
#define vll vector<ll>
#define vpii vector<pii >
#define mll map<ll, ll>
#define mpii map<pii,ll> 
#define msll map<string, ll> 
#define sortv(v) sort(v.begin(),v.end())
#define F first
#define S second
//standard values
#define mod (ll)(1e9+7)
#define INF (ll)1e16
#define MAXN (ll)(1e5+5)
//comparator
bool cmp(pair<pii, ll> a,pair<pii, ll> b){
  if(a.F.F<b.F.F) return a<b;
  if(a.F.F == b.F.F && a.F.S!=b.F.S){
    return a.F.S<b.F.S;
  }
  if(a.F == b.F && a.S == b.S){
    return a.S<b.S; 
  }
  return a<b;
}
ll exp(ll a,ll b){ll ans=1;while(b!=0){if(b%2==1)ans=ans*a;a=a*a;b/=2;}return ans;}
/********************************************************************************************************/
bool cmp2(ll n, pair<pii, ll> & p)
{
    return n < p.F.F;
}
ll cnt[MAXN];
mll mp;
ll fnc(ll a)
{
	//cout<<a<<endl;
	if(a < MAXN) return cnt[a];
	if(mp[a] != 0) return mp[a];
	ll val = 0;
	f(i,2,sqrt(a)+1){
		if(a%i==0){
			val = max(val, max(1+(a/i)*fnc(i), 1+i*fnc(a/i)));
		}
	}
	if(val == 0)
		val = a+1;
	return mp[a] = val;
}
int main() 
{
  bio;
  cnt[1] = 1;
  for(int num=2;num<MAXN;num++){
  	ll ans = 0;
  	for(int i=2; i<=sqrt(num); i++){
  		if(num%i == 0){
  			ans = max(ans, max(1+(num/i)*cnt[i], 1+i*cnt[num/i]));
  		}
  	}
  	cnt[num] = ans;
  	if(ans == 0)
  		cnt[num] = num+1;
  }
  ll n;
  cin>>n;
  ll sum = 0;
  f(i,0,n){
  	ll a;
  	cin>>a;
  	ll val = fnc(a);
  	// if(a>=MAXN){
  	// 	f(i,2,sqrt(a)+1){
  	// 		if(a%i==0){
  	// 			val = max(val, max(1+(a/i)*fnc(i), 1+i*fnc(a/i)));
  	// 		}
  	// 	}
  	// 	if(val == 0)
  	// 		val = a+1;
  	// }
  	// else{
  	// 	val = cnt[a];
  	// }
  	sum += val;
  }
  cout<<sum<<endl;
  return 0;
}