#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll p(ll n)
{
	vector<ll> v;
    vector<ll> arr;
	for (ll i=1; i<=sqrt(n); i++)
	{
		if (n%i==0)
		{
			if (n/i == i) 
            {
                arr.push_back(i);
            }
			else
            {
                arr.push_back(i);
				v.push_back(n/i);
			}
		}
	}

	for (ll i=v.size()-1; i>=0; i--)
		arr.push_back(v[i]);
    ll tmp=arr[arr.size()-1],ans=0;
    for(ll i=arr.size()-2;i>=0;i--)
    {
        if(tmp%arr[i] == 0)
        {
            ans+=arr[i];
            tmp=arr[i];
        }
    }
    return ans+n;
}
int main()
{
    ll n,q,ans=0;
    cin >> n;
    for(int i=0;i<n;i++)
    {
        cin >> q;
        ans+=p(q);
    }
    cout << ans;
	return 0;
}