#include<bits/stdc++.h>
#define ll long long
#define ss string
#define pb push_back
#define rev(i,n) for(ll i=0;i<n;i++)
#define rev1(i,n) for(ll i=n-1;i>=0;i--)
#define sync ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define all(v) v.begin(),v.end()
#define S second
#define F first
#define tci(v,i) for(map<ll,ll>::iterator i=v.begin();i!=v.end();i++)
#define MOD 1000000007
#define TIMESTAMP cerr<<(((double)clock())/CLOCKS_PER_SEC)
#define  rep(i,start,lim) for(ll (i)=(start);i<(lim);i++)
using namespace std;
vector<ll> prime;
ll A[1000005];
void sieve()
{
	for(ll i=2;i<=1000000;i++)
	{
		if(A[i]==0){
			prime.pb(i);
		for(ll j=2*i;j<=1000000;j+=i)
		{
			A[j]=i;
		}
	}
	}
}
int32_t main()
{
    sync;sieve();
    ll n,ans=0;cin>>n;ll a[n];rev(i,n){cin>>a[i];}
    rev(i,n)
    {
    	vector<ll> v;ll x=a[i],fa=0,k=1;v.pb(1);
    	for(ll j=0;j<prime.size();j++)
    	{
    		if(x%prime[j]==0)
    		{
    			v.pb(prime[j]);x/=prime[j];
    			//cout<<prime[j]<<" ";
    			j--;
    			
    		}
    	}
//    	cout<<endl;
    	if(x>1000000){v.pb(x);}
    	x=a[i];sort(all(v),greater<ll>());
    	rev(j,v.size())
    	{
    		fa+=k;k*=v[j];//cout<<v[j]<<" ";
    	}
    	ans+=fa;
    	//cout<<endl;
    }
    cout<<ans;


}