//coded by dsingh_24
#include<bits/stdc++.h>
#define ll          long long
#define pb          push_back
#define mp          make_pair
#define pll         pair<long long,long long>
#define vll          vector<long long>
#define all(a)      (a).begin(),(a).end()
#define F           first
#define S           second
#define sz(x)       (long long)x.size()
#define hell        1000000007
#define lbnd        lower_bound
#define ubnd        upper_bound
#define bs          binary_search
#define ios         ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
vector<ll> v;
void fun(ll n)
{
    while (n%2 == 0)
    {
        v.push_back(2);
        n = n/2;
    }
    for (ll i = 3; i <= sqrt(n); i = i+2)
    {
        while (n%i == 0)
        {
            v.push_back(i);
            n = n/i;
        }
    }
    if (n > 2)
        v.push_back(n);
		sort(all(v));        
}
int main()
{
	ll n;cin>>n;
	ll a[n];ll sum=0;
    for(ll i=0;i<n;i++)
    {
    	cin>>a[i];
    	ll x=a[i];
    	sum+=x;fun(x);
    	for(ll j=0;j<v.size();j++)
    	{
    		sum+=x/v[j];
    		x=x/v[j];
		}
		v.clear();
	}
	cout<<sum;
}